Sequences
392,541 sequences
- Number of partitions of n including 3, but not 1.A085811
Number of partitions of n including 3, but not 1.
- Sum(sum(binomial(i,j),i=n..2*n),j=0..n).A085812
Sum(sum(binomial(i,j),i=n..2*n),j=0..n).
- Number of cards that need to be drawn (with replacement) from a deck of n cards to have a 95% or greater chance of seeing each card at least once.A085813
Number of cards that need to be drawn (with replacement) from a deck of n cards to have a 95% or greater chance of seeing each card at least once.
- Even entries (A048967) minus the odd entries (A001316) in row n of Pascal's triangle (A007318).A085814
Even entries (A048967) minus the odd entries (A001316) in row n of Pascal's triangle (A007318).
- Least k such that A056830(n) + k is prime, where A056830 = alternate digits 1 and 0.A085815
Least k such that A056830(n) + k is prime, where A056830 = alternate digits 1 and 0.
- Semiprimes such that the sum of the factorials of the digits is also semiprime.A085816
Semiprimes such that the sum of the factorials of the digits is also semiprime.
- Start at (2n+1)/4 and iterate the map x -> x*ceiling(x); sequence gives values of n for which the denominators in the orbit drop directly from 4 to 1, bypassing 2.A085817
Start at (2n+1)/4 and iterate the map x -> x*ceiling(x); sequence gives values of n for which the denominators in the orbit drop directly from 4 to 1, bypassing 2.
- For n > 1: a(n) = p if n = p^e with p prime and e > 1, otherwise a(n) = (n-m)-th prime, where m = number of nonprime prime powers <= n; a(1)=1.A085818
For n > 1: a(n) = p if n = p^e with p prime and e > 1, otherwise a(n) = (n-m)-th prime, where m = number of nonprime prime powers <= n; a(1)=1.
- a(n) = Product_{k<=n} A085818(k).A085819
a(n) = Product_{k<=n} A085818(k).
- Possible two-digit endings of primes (with leading zeros).A085820
Possible two-digit endings of primes (with leading zeros).
- Smallest prime > A085820(n) ending with A085820(n).A085821
Smallest prime > A085820(n) ending with A085820(n).
- Smallest prime with n prime substrings (excluding prime itself but allowing leading zeros).A085822
Smallest prime with n prime substrings (excluding prime itself but allowing leading zeros).
- Numbers in which all substrings are primes.A085823
Numbers in which all substrings are primes.
- Numbers n such that the smallest prime containing exactly n 0's (A037053) requires only two nonzero digits.A085824
Numbers n such that the smallest prime containing exactly n 0's (A037053) requires only two nonzero digits.
- Decimal expansion of number with continued fraction 2 + 3/5 + 7/11 + 13/17 + 19/23 + ...A085825
Decimal expansion of number with continued fraction 2 + 3/5 + 7/11 + 13/17 + 19/23 + ...
- Continued fraction expansion of number defined in A085825.A085826
Continued fraction expansion of number defined in A085825.
- Increasing partial quotients of number defined in A085825 and A085826.A085827
Increasing partial quotients of number defined in A085825 and A085826.
- Lesser number n of a pair such that neither n nor n+1 contain the digit zero in bases 3 to 10.A085828
Lesser number n of a pair such that neither n nor n+1 contain the digit zero in bases 3 to 10.
- a(n) = least k such that the average number of divisors of {1..k} is >= n.A085829
a(n) = least k such that the average number of divisors of {1..k} is >= n.
- Least number k such that (10^n)^k < k!.A085830
Least number k such that (10^n)^k < k!.
- a(n) = Sum_{k=1..2^n} d(k) where d(n) = number of divisors of n (A000005).A085831
a(n) = Sum_{k=1..2^n} d(k) where d(n) = number of divisors of n (A000005).
- Smallest prime p such that both (p-1)/2^(2n-1) and 2^(2n-1)*p+1 are primes.A085832
Smallest prime p such that both (p-1)/2^(2n-1) and 2^(2n-1)*p+1 are primes.
- Start at (2n+1)/4 and iterate the map x -> x*ceiling(x); sequence gives values of n for which the denominators in the orbit go from 4 to 2, instead of dropping directly to 1.A085833
Start at (2n+1)/4 and iterate the map x -> x*ceiling(x); sequence gives values of n for which the denominators in the orbit go from 4 to 2, instead of dropping directly to 1.
- Initial terms of rows in table A085612.A085834
Initial terms of rows in table A085612.
- Decimal expansion of Grossman's constant.A085835
Decimal expansion of Grossman's constant.
- Final terms of rows of A085612.A085836
Final terms of rows of A085612.
- Denominators of unit fractions having non-terminating decimal expansions.A085837
Denominators of unit fractions having non-terminating decimal expansions.
- Triangle T(n,k) read by rows; given by [0,1,0,1,0,1,0,1,...] DELTA [1,1,1,2,1,3,1,4,1,5,1,6,...], where DELTA is Deléham's operator defined in A084938.A085838
Triangle T(n,k) read by rows; given by [0,1,0,1,0,1,0,1,...] DELTA [1,1,1,2,1,3,1,4,1,5,1,6,...], where DELTA is Deléham's operator defined in A084938.
- a(0)=1, a(1)=3, a(n) = floor((Pi + 1/Pi)*a(n-1) - a(n-2)).A085839
a(0)=1, a(1)=3, a(n) = floor((Pi + 1/Pi)*a(n-1) - a(n-2)).
- Triangle read by rows: T(n,m) = 4^m * (2*n+1)! / ( (2*n - 2*m + 1)! * (2*m)! ), row n has n+1 terms.A085840
Triangle read by rows: T(n,m) = 4^m * (2*n+1)! / ( (2*n - 2*m + 1)! * (2*m)! ), row n has n+1 terms.
- Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).A085841
Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).
- Numbers k whose divisors (apart from 1 and k) sum to a prime.A085842
Numbers k whose divisors (apart from 1 and k) sum to a prime.
- Triangle T(n, k) read by rows; given by [1, 1, 1, 1, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is Deléham's operator defined in A084938.A085843
Triangle T(n, k) read by rows; given by [1, 1, 1, 1, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is Deléham's operator defined in A084938.
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.A085844
Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.
- Triangle T(n, k) read by rows; given by [0, 1, 0, 1, 0, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is Deléham's operator defined in A084938.A085845
Triangle T(n, k) read by rows; given by [0, 1, 0, 1, 0, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is Deléham's operator defined in A084938.
- Decimal expansion of root of x = (1+1/x)^x.A085846
Decimal expansion of root of x = (1+1/x)^x.
- Members of A085844 which are permutations of other members of A085844.A085847
Members of A085844 which are permutations of other members of A085844.
- Decimal expansion of Foias' constant.A085848
Decimal expansion of Foias' constant.
- Decimal expansion of the probability that two m X m and n X n matrices (m,n large) have relatively prime determinants.A085849
Decimal expansion of the probability that two m X m and n X n matrices (m,n large) have relatively prime determinants.
- Decimal expansion of hard square entropy constant.A085850
Decimal expansion of hard square entropy constant.
- Decimal expansion of hard hexagon entropy constant.A085851
Decimal expansion of hard hexagon entropy constant.
- Triangle T(n, k) read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, ...] DELTA [1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 4, 0, 2, 0, ...] (A000005 interspersed with 0's) where DELTA is Deléham's operator defined in A084938.A085852
Triangle T(n, k) read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, ...] DELTA [1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 4, 0, 2, 0, ...] (A000005 interspersed with 0's) where DELTA is Deléham's operator defined in A084938.
- Triangle T(n, k) read by rows; given by [1, 1, 1, 1, 1, 1, 1, 1, ...] DELTA [1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 4, 0, 2, 0, ...] (A000005 interspersed with 0's) where DELTA is Deléham's operator defined in A084938.A085853
Triangle T(n, k) read by rows; given by [1, 1, 1, 1, 1, 1, 1, 1, ...] DELTA [1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 4, 0, 2, 0, ...] (A000005 interspersed with 0's) where DELTA is Deléham's operator defined in A084938.
- Number of 0's in decimal expansion of Fibonacci(n).A085854
Number of 0's in decimal expansion of Fibonacci(n).
- Number of 1's in decimal expansion of Fibonacci(n).A085855
Number of 1's in decimal expansion of Fibonacci(n).
- Number of 2's in decimal expansion of Fibonacci(n).A085856
Number of 2's in decimal expansion of Fibonacci(n).
- Number of 3's in decimal expansion of Fibonacci(n).A085857
Number of 3's in decimal expansion of Fibonacci(n).
- Number of 4's in decimal expansion of Fibonacci(n).A085858
Number of 4's in decimal expansion of Fibonacci(n).
- Number of 5's in decimal expansion of Fibonacci(n).A085859
Number of 5's in decimal expansion of Fibonacci(n).
- Number of 6's in decimal expansion of Fibonacci(n).A085860
Number of 6's in decimal expansion of Fibonacci(n).