Most probably CPANTS databases are being regenerated from scratch due to major changes in Kwalitee metrics or updates of relevant modules/perl. Usually this maintenance takes about a day or two, and some of the information may be old or missing tentatively. Sorry for the inconvenience.
Add a README to the distribution. It should contain a quick description of your module and how to install it.
Change the permissions of Build.PL/Makefile.PL to not-executable.
Sign the dist as the last step before creating the archive. Take care not to modify/regenerate dist meta files or the manifest.
Error: Old SIGNATURE detected. Please inform the module author to regenerate SIGNATURE using Module::Signature version 0.82 or newer. gpg: Signature made Wed 25 Jan 2012 05:13:46 AM JST gpg: using DSA key 2C5302215F6ADD3A gpg: Can't check signature: No public key ==> BAD/TAMPERED signature detected! <==
Add a META.json to the distribution. Your buildtool should be able to autogenerate it.
Add 'use warnings' (or its equivalents) to all modules, or convince us that your favorite module is well-known enough and people can easily see the modules warn when something bad happens.
Error: Math::NumSeq, Math::NumSeq::Abundant, Math::NumSeq::All, Math::NumSeq::AllDigits, Math::NumSeq::AlmostPrimes, Math::NumSeq::AsciiSelf, Math::NumSeq::Base::Array, Math::NumSeq::Base::Digits, Math::NumSeq::Base::IterateIth, Math::NumSeq::Base::IteratePred, Math::NumSeq::Base::Sparse, Math::NumSeq::BaumSweet, Math::NumSeq::Beastly, Math::NumSeq::CollatzSteps, Math::NumSeq::Cubes, Math::NumSeq::CullenNumbers, Math::NumSeq::DigitCount, Math::NumSeq::DigitCountHigh, Math::NumSeq::DigitCountLow, Math::NumSeq::DigitLength, Math::NumSeq::DigitLengthCumulative, Math::NumSeq::DigitProduct, Math::NumSeq::DigitSum, Math::NumSeq::DigitSumModulo, Math::NumSeq::DivisorCount, Math::NumSeq::Emirps, Math::NumSeq::Even, Math::NumSeq::Expression, Math::NumSeq::Factorials, Math::NumSeq::Fibbinary, Math::NumSeq::FibbinaryBitCount, Math::NumSeq::Fibonacci, Math::NumSeq::FibonacciWord, Math::NumSeq::File, Math::NumSeq::FractionDigits, Math::NumSeq::GolombSequence, Math::NumSeq::HappyNumbers, Math::NumSeq::HappySteps, Math::NumSeq::HarshadNumbers, Math::NumSeq::JugglerSteps, Math::NumSeq::KlarnerRado, Math::NumSeq::Kolakoski, Math::NumSeq::LiouvilleFunction, Math::NumSeq::LucasNumbers, Math::NumSeq::MephistoWaltz, Math::NumSeq::MobiusFunction, Math::NumSeq::Modulo, Math::NumSeq::Multiples, Math::NumSeq::NumAronson, Math::NumSeq::OEIS, Math::NumSeq::OEIS::Catalogue, Math::NumSeq::OEIS::Catalogue::Plugin, Math::NumSeq::OEIS::Catalogue::Plugin::BuiltinTable, Math::NumSeq::OEIS::Catalogue::Plugin::FractionDigits, Math::NumSeq::OEIS::Catalogue::Plugin::ZZ_Files, Math::NumSeq::OEIS::File, Math::NumSeq::Odd, Math::NumSeq::Palindromes, Math::NumSeq::Pell, Math::NumSeq::Perrin, Math::NumSeq::PolignacObstinate, Math::NumSeq::Polygonal, Math::NumSeq::PowerPart, Math::NumSeq::Powerful, Math::NumSeq::PrimeFactorCount, Math::NumSeq::Primes, Math::NumSeq::Primorials, Math::NumSeq::Pronic, Math::NumSeq::ProthNumbers, Math::NumSeq::PythagoreanHypots, Math::NumSeq::RadixWithoutDigit, Math::NumSeq::ReRound, Math::NumSeq::RepdigitAny, Math::NumSeq::RepdigitRadix, Math::NumSeq::Repdigits, Math::NumSeq::ReverseAdd, Math::NumSeq::ReverseAddSteps, Math::NumSeq::SophieGermainPrimes, Math::NumSeq::SqrtContinued, Math::NumSeq::SqrtContinuedPeriod, Math::NumSeq::SqrtDigits, Math::NumSeq::SqrtEngel, Math::NumSeq::Squares, Math::NumSeq::StarNumbers, Math::NumSeq::SternDiatomic, Math::NumSeq::Tetrahedral, Math::NumSeq::Totient, Math::NumSeq::TotientCumulative, Math::NumSeq::TotientPerfect, Math::NumSeq::TotientSteps, Math::NumSeq::TotientStepsSum, Math::NumSeq::Triangular, Math::NumSeq::Tribonacci, Math::NumSeq::TwinPrimes, Math::NumSeq::UlamSequence, Math::NumSeq::WoodallNumbers
Add all modules contained in this distribution to the META.yml field 'provides'. Module::Build or Dist::Zilla::Plugin::MetaProvides do this automatically for you.
Add a 'repository' resource to the META.yml via 'meta_add' accessor (for Module::Build) or META_ADD parameter (for ExtUtils::MakeMaker).
Add SECURITY(.pod|md). See Software::Security::Policy.
Add SECURITY(.pod|md) and add a contact address. See Software::Security::Policy.
Add CONTRIBUTING(.pod|md). See https://docs.github.com/en/communities/setting-up-your-project-for-healthy-contributions/setting-guidelines-for-repository-contributors.
| Name | Abstract | Version | View |
|---|---|---|---|
| Math::NumSeq | number sequences | 31 | metacpan |
| Math::NumSeq::Abundant | abundant numbers, greater than sum of divisors | 31 | metacpan |
| Math::NumSeq::All | all integers | 31 | metacpan |
| Math::NumSeq::AllDigits | digits of the integers | 31 | metacpan |
| Math::NumSeq::AlmostPrimes | semiprimes and other fixed number of prime factors | 31 | metacpan |
| Math::NumSeq::AsciiSelf | sequence is its own ASCII digits | 31 | metacpan |
| Math::NumSeq::Base::Array | 31 | metacpan | |
| Math::NumSeq::Base::Digits | 31 | metacpan | |
| Math::NumSeq::Base::IterateIth | 31 | metacpan | |
| Math::NumSeq::Base::IteratePred | 31 | metacpan | |
| Math::NumSeq::Base::Sparse | 31 | metacpan | |
| Math::NumSeq::BaumSweet | Baum-Sweet sequence | 31 | metacpan |
| Math::NumSeq::Beastly | numbers containing digits "666" | 31 | metacpan |
| Math::NumSeq::CollatzSteps | steps in the "3n+1" problem | 31 | metacpan |
| Math::NumSeq::Cubes | cubes i^3 | 31 | metacpan |
| Math::NumSeq::CullenNumbers | Cullen numbers i*2^i+1 | 31 | metacpan |
| Math::NumSeq::DigitCount | count of a given digit | 31 | metacpan |
| Math::NumSeq::DigitCountHigh | count of given high digits | 31 | metacpan |
| Math::NumSeq::DigitCountLow | count of given low digits | 31 | metacpan |
| Math::NumSeq::DigitLength | length in digits | 31 | metacpan |
| Math::NumSeq::DigitLengthCumulative | total length in digits of numbers 1 to i | 31 | metacpan |
| Math::NumSeq::DigitProduct | product of digits | 31 | metacpan |
| Math::NumSeq::DigitSum | sum of digits, possibly with powering | 31 | metacpan |
| Math::NumSeq::DigitSumModulo | digit sum taken modulo a given modulus | 31 | metacpan |
| Math::NumSeq::DivisorCount | how many divisors | 31 | metacpan |
| Math::NumSeq::Emirps | primes backwards and forwards | 31 | metacpan |
| Math::NumSeq::Even | even integers | 31 | metacpan |
| Math::NumSeq::Expression | mathematical expression values | 31 | metacpan |
| Math::NumSeq::Factorials | factorials 1*2*...*i | 31 | metacpan |
| Math::NumSeq::Fibbinary | without consecutive 1 bits | 31 | metacpan |
| Math::NumSeq::FibbinaryBitCount | number of bits in each fibbinary number | 31 | metacpan |
| Math::NumSeq::Fibonacci | Fibonacci numbers | 31 | metacpan |
| Math::NumSeq::FibonacciWord | 0/1 related to Fibonacci numbers | 31 | metacpan |
| Math::NumSeq::File | 31 | metacpan | |
| Math::NumSeq::FractionDigits | the digits of a fraction p/q | 31 | metacpan |
| Math::NumSeq::GolombSequence | sequence is its own run lengths, 1 upwards | 31 | metacpan |
| Math::NumSeq::HappyNumbers | reaching 1 under repeated sum of squares of digits | 31 | metacpan |
| Math::NumSeq::HappySteps | number of sum of squares of digits iterations to reach a repeat | 31 | metacpan |
| Math::NumSeq::HarshadNumbers | numbers divisible by sum of digits | 31 | metacpan |
| Math::NumSeq::JugglerSteps | steps in the juggler sqrt sequence | 31 | metacpan |
| Math::NumSeq::KlarnerRado | Klarner-Rado sequences | 31 | metacpan |
| Math::NumSeq::Kolakoski | sequence of 1s and 2s its own run lengths | 31 | metacpan |
| Math::NumSeq::LiouvilleFunction | Liouville function sequence | 31 | metacpan |
| Math::NumSeq::LucasNumbers | Lucas numbers | 31 | metacpan |
| Math::NumSeq::MephistoWaltz | Mephisto waltz sequence | 31 | metacpan |
| Math::NumSeq::MobiusFunction | Mobius function sequence | 31 | metacpan |
| Math::NumSeq::Modulo | remainders modulo of a given number | 31 | metacpan |
| Math::NumSeq::Multiples | multiples of a given number | 31 | metacpan |
| Math::NumSeq::NumAronson | numerical version of Aronson's sequence | 31 | metacpan |
| Math::NumSeq::OEIS | number sequence by OEIS A-number | 31 | metacpan |
| Math::NumSeq::OEIS::Catalogue | available A-numbers | 31 | metacpan |
| Math::NumSeq::OEIS::Catalogue::Plugin | pluggable catalogue extensions | 31 | metacpan |
| Math::NumSeq::OEIS::Catalogue::Plugin::BuiltinTable | 31 | metacpan | |
| Math::NumSeq::OEIS::Catalogue::Plugin::FractionDigits | 31 | metacpan | |
| Math::NumSeq::OEIS::Catalogue::Plugin::ZZ_Files | 31 | metacpan | |
| Math::NumSeq::OEIS::File | 31 | metacpan | |
| Math::NumSeq::Odd | odd integers | 31 | metacpan |
| Math::NumSeq::Palindromes | palindrome numbers like 15351 | 31 | metacpan |
| Math::NumSeq::Pell | Pell numbers | 31 | metacpan |
| Math::NumSeq::Perrin | Perrin sequence | 31 | metacpan |
| Math::NumSeq::PolignacObstinate | odd integers not prime+2^k | 31 | metacpan |
| Math::NumSeq::Polygonal | polygonal numbers, triangular, square, pentagonal, etc | 31 | metacpan |
| Math::NumSeq::PowerPart | largest square root etc divisor | 31 | metacpan |
| Math::NumSeq::Powerful | numbers with certain prime powers | 31 | metacpan |
| Math::NumSeq::PrimeFactorCount | how many prime factors | 31 | metacpan |
| Math::NumSeq::Primes | prime numbers | 31 | metacpan |
| Math::NumSeq::Primorials | primorials 2*3*...*p[i] | 31 | metacpan |
| Math::NumSeq::Pronic | pronic numbers | 31 | metacpan |
| Math::NumSeq::ProthNumbers | Proth number sequence | 31 | metacpan |
| Math::NumSeq::PythagoreanHypots | hypotenuses of Pythagorean triples | 31 | metacpan |
| Math::NumSeq::RadixWithoutDigit | integers without a given digit | 31 | metacpan |
| Math::NumSeq::ReRound | sequence from repeated rounding up | 31 | metacpan |
| Math::NumSeq::RepdigitAny | numbers which are a repdigit in any radix | 31 | metacpan |
| Math::NumSeq::RepdigitRadix | radix in which i is a repdigit | 31 | metacpan |
| Math::NumSeq::Repdigits | repdigits 11, 22, 33, etc | 31 | metacpan |
| Math::NumSeq::ReverseAdd | steps of the reverse-add algorithm | 31 | metacpan |
| Math::NumSeq::ReverseAddSteps | steps of the reverse-add algorithm to reach palindrome | 31 | metacpan |
| Math::NumSeq::SophieGermainPrimes | Sophie Germain primes p and 2*p+1 prime | 31 | metacpan |
| Math::NumSeq::SqrtContinued | continued fraction expansion of a square root | 31 | metacpan |
| Math::NumSeq::SqrtContinuedPeriod | period of the continued fraction for sqrt(i) | 31 | metacpan |
| Math::NumSeq::SqrtDigits | the digits of a square root | 31 | metacpan |
| Math::NumSeq::SqrtEngel | Engel expansion of a square root | 31 | metacpan |
| Math::NumSeq::Squares | perfect squares | 31 | metacpan |
| Math::NumSeq::StarNumbers | star numbers 6*i*(i-1)+1 | 31 | metacpan |
| Math::NumSeq::SternDiatomic | Stern's diatomic sequence | 31 | metacpan |
| Math::NumSeq::Tetrahedral | tetrahedral numbers i*(i+1)*(i+2)/6 | 31 | metacpan |
| Math::NumSeq::Totient | Euler's totient function, count of coprimes | 31 | metacpan |
| Math::NumSeq::TotientCumulative | cumulative totients | 31 | metacpan |
| Math::NumSeq::TotientPerfect | sum of repeated totients is N itself | 31 | metacpan |
| Math::NumSeq::TotientSteps | count of repeated totients to reach 1 | 31 | metacpan |
| Math::NumSeq::TotientStepsSum | sum of repeated totients to reach 1 | 31 | metacpan |
| Math::NumSeq::Triangular | triangular numbers | 31 | metacpan |
| Math::NumSeq::Tribonacci | Tribonacci numbers | 31 | metacpan |
| Math::NumSeq::TwinPrimes | twin primes | 31 | metacpan |
| Math::NumSeq::UlamSequence | integers uniquely the sum of two previous terms | 31 | metacpan |
| Math::NumSeq::WoodallNumbers | Woodall numbers i*2^i-1 | 31 | metacpan |
| Name | File | View |
|---|---|---|
| Math::NumSeq::Expression::LanguageExpr | lib/Math/NumSeq/Expression.pm | metacpan |