-
-
04 Jun 2022 12:11:23 UTC
- Browse (raw)
- Changes
- Homepage
- How to Contribute
- Issues (1)
- Testers (369 / 27 / 0)
- Kwalitee
Bus factor: 1- License: gpl_3
- Perl: v5.4.0
- Activity
24 month- Tools
- Download (847.03KB)
- MetaCPAN Explorer
- Permissions
- Subscribe to distribution
- Permalinks
- This version
- Latest version
Modules
number sequencesabundant numbers, greater than sum of divisorscontinued fraction expansion of algebraic numbersall integersdigits of the integersprime factors of the integerssemiprimes and other fixed number of prime factorssequence is its own ASCII digitsbalanced 1,0 bitsiterate by calling ith() successivelyiterate by searching with pred()Baum-Sweet sequencenumbers containing digits "666"Catalan numbers (2n)! / (n!*(n+1)!)steps in the "3n+1" problemconcatenate digits of i, i+1cubes i**3Cullen numbers i*2^i+1cumulative Psi functionpsi function until 2^x*3^yprimes on deleting a digit repeatedlycount of a given digitcount of given high digitscount of given low digitslength in digitstotal length in digits of numbers 1 to iproduct of digitsmultiplicative persistence and digital rootsum of digits, possibly with poweringdigit sum taken modulo a given modulushow many divisorsno common factor with sum of divisorsprimes backwards and forwardsErdos-Selfridge classification of primeseven integersmathematical expression valuesfactorials i! = 1*2*...*iwithout consecutive 1-bitsnumber of bits in each fibbinary numberFibonacci numberscount of representations by sum of Fibonacci numbers0/1 related to Fibonacci numberssequence read from a filethe digits of a fraction p/qparity of adjacent 11 bit pairscumulative Golay/RudinShapiro sequencenumber of representations as sum of primes P+Qsequence is its own run lengths, 1 upwardsbits of the Haferman carpetreaching 1 under repeated sum of squares of digitsnumber of sum of squares of digits iterations to reach a repeatnumbers divisible by sum of digitssequence excludes its own first differencessteps in the juggler sqrt sequenceKlarner-Rado sequencessequence of 1s and 2s its own run lengthsnumber of representations as P+2*Q for primes P,QLiouville function sequenceLucas numberssieved out multiples by the sequence itselfmaximum count of a given digit in any radixMephisto waltz sequenceMobius function sequenceremainders modulo of a given numbernumbers divided by sum of digits giving a primemultiples of a given numbernumerical version of Aronson's sequencenumber sequence by OEIS A-numberavailable A-numberspluggable catalogue extensionsodd integerspalindrome numbers like 15351Pell numbersPerrin sequencecycle length of Fibonacci numbers mod iFibonacci frequency and Leonardo logarithmodd integers not prime+2^kpolygonal numbers, triangular, square, pentagonal, etcprime exponent fliplargest square root etc divisornumbers with certain prime powershow many prime factorsorder of primeness by primes at prime indexesprimes with prime number indexesprime numbersprimorials 2*3*...*p[i]pronic numbersProth number sequencehypotenuses of Pythagorean triplesradix conversionintegers without a given digitsequence of repeated replacementssequence from repeated rounding upnumbers which are a repdigit in any radixradix in which i is a repdigitrepdigits 11, 22, 33, etcsteps of the reverse-add algorithmsteps of the reverse-add algorithm to reach palindromeruns of consecutive integerscumulative digit length of own valuesSophie Germain primes p and 2*p+1 primerecurrence around a square spiralcontinued fraction expansion of a square rootperiod of the continued fraction for sqrt(i)the digits of a square rootEngel expansion of a square rootperfect squaresstar numbers 6*i*(i-1)+1Stern's diatomic sequencetetrahedral numbers i*(i+1)*(i+2)/6Euler's totient function, count of coprimescumulative totientssum of repeated totients is N itselfcount of repeated totients to reach 1sum of repeated totients to reach 1triangular numbersTribonacci numberstwin primesintegers uniquely the sum of two previous termsnumbers with alternating digits ABABAB...Woodall numbers i*2^i-1integers with all digits uniqueProvides
in lib/Math/NumSeq/Base/Array.pmin lib/Math/NumSeq/Base/Cache.pmin lib/Math/NumSeq/Base/Digits.pmin lib/Math/NumSeq/Base/Sparse.pmin lib/Math/NumSeq/Expression.pmin lib/Math/NumSeq/OEIS/Catalogue/Plugin/BuiltinTable.pmin lib/Math/NumSeq/OEIS/Catalogue/Plugin/FractionDigits.pmin lib/Math/NumSeq/OEIS/Catalogue/Plugin/ZZ_Files.pmin lib/Math/NumSeq/OEIS/File.pmModule Install Instructions
To install Math::NumSeq, copy and paste the appropriate command in to your terminal.
cpanm Math::NumSeq
perl -MCPAN -e shell install Math::NumSeq
For more information on module installation, please visit the detailed CPAN module installation guide.