Sequences
392,541 sequences
- Positions of 5-digit terms in the continued fraction for Pi (3 is position 0).A048961
Positions of 5-digit terms in the continued fraction for Pi (3 is position 0).
- Table in which n-th row lists digits in periodic part of decimal expansion of 1/n.A048962
Table in which n-th row lists digits in periodic part of decimal expansion of 1/n.
- Table in which n-th row lists digits in periodic part of decimal expansion of reciprocal of n-th prime.A048963
Table in which n-th row lists digits in periodic part of decimal expansion of reciprocal of n-th prime.
- a(n) is smallest number k such that k! >= n-th primorial number (A002110(n)).A048964
a(n) is smallest number k such that k! >= n-th primorial number (A002110(n)).
- Row sums of triangle A048882.A048965
Row sums of triangle A048882.
- A convolution triangle of numbers obtained from A025748.A048966
A convolution triangle of numbers obtained from A025748.
- Number of even entries in row n of Pascal's triangle (A007318).A048967
Number of even entries in row n of Pascal's triangle (A007318).
- Numbers k such that sigma(k) / d(k) is prime.A048968
Numbers k such that sigma(k) / d(k) is prime.
- Composite numbers k such that sigma(k) / d(k) is prime.A048969
Composite numbers k such that sigma(k) / d(k) is prime.
- Prime Keith numbers.A048970
Prime Keith numbers.
- Let d(n) = number of distinct primes dividing n (A001221); sequence gives t such that d(t)=d(t+1)=...=d(t+n-1) is a run of record length.A048971
Let d(n) = number of distinct primes dividing n (A001221); sequence gives t such that d(t)=d(t+1)=...=d(t+n-1) is a run of record length.
- Length of record run mentioned in A048971.A048972
Length of record run mentioned in A048971.
- Complement of A005243.A048973
Complement of A005243.
- Odd numbers that are the sum of 2 primes.A048974
Odd numbers that are the sum of 2 primes.
- Pairs of consecutive primes p, q, for which the smallest primitive root of q is 1 greater than the smallest primitive root of p.A048975
Pairs of consecutive primes p, q, for which the smallest primitive root of q is 1 greater than the smallest primitive root of p.
- Primes whose least primitive root is an odd prime.A048976
Primes whose least primitive root is an odd prime.
- Primes arising in A048969.A048977
Primes arising in A048969.
- Light numbers, those whose mean sum of divisors <= mean running sum of divisors of all previous n.A048978
Light numbers, those whose mean sum of divisors <= mean running sum of divisors of all previous n.
- Primes in A011784.A048979
Primes in A011784.
- Difference between number of nonprimes and primes in reduced residue system of primorial numbers.A048980
Difference between number of nonprimes and primes in reduced residue system of primorial numbers.
- Squarefree values of n for which the quadratic field Q[ sqrt(n) ] is norm-Euclidean.A048981
Squarefree values of n for which the quadratic field Q[ sqrt(n) ] is norm-Euclidean.
- Number of numbers which have a "prime-rich" reduced residue system (RRS) and binary order n.A048982
Number of numbers which have a "prime-rich" reduced residue system (RRS) and binary order n.
- As n runs through composite numbers, a(n) = number of composite d < n such that gcd(d,n) = 1.A048983
As n runs through composite numbers, a(n) = number of composite d < n such that gcd(d,n) = 1.
- As n runs through composite numbers, a(n) = number of nonprime d < n such that gcd(d,n) = 1.A048984
As n runs through composite numbers, a(n) = number of nonprime d < n such that gcd(d,n) = 1.
- Working in base 2, replace n with the concatenation of its prime divisors in increasing order (write answer in base 10).A048985
Working in base 2, replace n with the concatenation of its prime divisors in increasing order (write answer in base 10).
- Home primes in base 2: primes reached when you start with n and (working in base 2) concatenate its prime factors (A048985); repeat until a prime is reached (or -1 if no prime is ever reached). Answer is written in base 10.A048986
Home primes in base 2: primes reached when you start with n and (working in base 2) concatenate its prime factors (A048985); repeat until a prime is reached (or -1 if no prime is ever reached). Answer is written in base 10.
- Number of possible chess games at the end of the n-th ply.A048987
Number of possible chess games at the end of the n-th ply.
- Primes of the form 4*k^2 + 4*k + 59.A048988
Primes of the form 4*k^2 + 4*k + 59.
- Numbers k such that pi(k) is prime.A048989
Numbers k such that pi(k) is prime.
- Catalan numbers with even index (A000108(2*n), n >= 0): a(n) = binomial(4*n, 2*n)/(2*n+1).A048990
Catalan numbers with even index (A000108(2*n), n >= 0): a(n) = binomial(4*n, 2*n)/(2*n+1).
- Write down the numbers 1,2,3,... but omit any number (such as 12 or 23 or 31 ...) which appears in the concatenation of all earlier terms.A048991
Write down the numbers 1,2,3,... but omit any number (such as 12 or 23 or 31 ...) which appears in the concatenation of all earlier terms.
- Hannah Rollman's numbers: the numbers excluded from A048991.A048992
Hannah Rollman's numbers: the numbers excluded from A048991.
- Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.A048993
Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.
- Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.A048994
Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.
- Numbers that are not the sum of the nontrivial factors (excluding 1 and n) of some natural number.A048995
Numbers that are not the sum of the nontrivial factors (excluding 1 and n) of some natural number.
- Irregular triangle read by rows. Preferred multisets: numbers refining A007318 using format described in A036038.A048996
Irregular triangle read by rows. Preferred multisets: numbers refining A007318 using format described in A036038.
- Sum of digits in decimal expansion of 1/n up to the point where it repeats for the first time.A048997
Sum of digits in decimal expansion of 1/n up to the point where it repeats for the first time.
- Triangle giving coefficients of (n+1)!*B_n(x), where B_n(x) is a Bernoulli polynomial. Rising powers of x.A048998
Triangle giving coefficients of (n+1)!*B_n(x), where B_n(x) is a Bernoulli polynomial. Rising powers of x.
- Triangle giving coefficients of (n+1)!*B_n(x), where B_n(x) is a Bernoulli polynomial, ordered by falling powers of x.A048999
Triangle giving coefficients of (n+1)!*B_n(x), where B_n(x) is a Bernoulli polynomial, ordered by falling powers of x.
- Sum of sigma(j) for 1<=j<10^n, where sigma(j) is the sum of divisors of j.A049000
Sum of sigma(j) for 1<=j<10^n, where sigma(j) is the sum of divisors of j.
- a(n) = prime(n)^2 - 2.A049001
a(n) = prime(n)^2 - 2.
- Primes of form p^2 - 2, where p is prime.A049002
Primes of form p^2 - 2, where p is prime.
- Primes of form p^3 - 4, p prime.A049003
Primes of form p^3 - 4, p prime.
- First letter of English names for months of year, mapping A -> 1, B -> 2 etc.A049004
First letter of English names for months of year, mapping A -> 1, B -> 2 etc.
- Number of letters in English names for days of week.A049005
Number of letters in English names for days of week.
- Decimal expansion of i^i = exp(-Pi/2).A049006
Decimal expansion of i^i = exp(-Pi/2).
- Continued fraction for i^i = exp(-Pi/2).A049007
Continued fraction for i^i = exp(-Pi/2).
- Greatest possible number of right angles that can occur as interior angles in a planar n-gon.A049008
Greatest possible number of right angles that can occur as interior angles in a planar n-gon.
- Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.A049009
Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.
- Mean divisor of n differs by <= 1 from mean divisor of all numbers from 1 to n-1.A049010
Mean divisor of n differs by <= 1 from mean divisor of all numbers from 1 to n-1.