Sequences
392,541 sequences
- Sums of three consecutive primes.A034961
Sums of three consecutive primes.
- Primes that are the sum of three consecutive primes.A034962
Primes that are the sum of three consecutive primes.
- Sums of four consecutive primes.A034963
Sums of four consecutive primes.
- Sums of five consecutive primes.A034964
Sums of five consecutive primes.
- Primes that are sum of five consecutive primes.A034965
Primes that are sum of five consecutive primes.
- Number of different values of i^2 + j^2 + k^2 for i,j,k in [ 0,n ] (or [ -n,n ]).A034966
Number of different values of i^2 + j^2 + k^2 for i,j,k in [ 0,n ] (or [ -n,n ]).
- Sum of digits of numbers between 0 and (10^n)-1.A034967
Sum of digits of numbers between 0 and (10^n)-1.
- Minimal number of factorials that add to n.A034968
Minimal number of factorials that add to n.
- a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1).A034969
a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1).
- a(n) is the greatest prime factor of a(n-2)*a(n-1)-1.A034970
a(n) is the greatest prime factor of a(n-2)*a(n-1)-1.
- a(n) = floor(E_(n+1)/E_(n)) where E_n is n-th Euler number (see A028296 and A000364).A034971
a(n) = floor(E_(n+1)/E_(n)) where E_n is n-th Euler number (see A028296 and A000364).
- a(n) = floor(T_(n+1)/T_(n)) where T_n is n-th tangential or "Zag" number (see A000182).A034972
a(n) = floor(T_(n+1)/T_(n)) where T_n is n-th tangential or "Zag" number (see A000182).
- Number of distinct prime factors in central binomial coefficients C(n, floor(n/2)), the terms of A001405.A034973
Number of distinct prime factors in central binomial coefficients C(n, floor(n/2)), the terms of A001405.
- Number of divisors of binomial(n, floor(n/2)), the terms of A001405.A034974
Number of divisors of binomial(n, floor(n/2)), the terms of A001405.
- One seventh of octo-factorial numbers.A034975
One seventh of octo-factorial numbers.
- One eighth of octo-factorial numbers.A034976
One eighth of octo-factorial numbers.
- Expansion of 1/(1-64*x)^(1/8), related to octo-factorial numbers A045755.A034977
Expansion of 1/(1-64*x)^(1/8), related to octo-factorial numbers A045755.
- a(n)^2 is smallest square starting with a string of n 1's.A034978
a(n)^2 is smallest square starting with a string of n 1's.
- Smallest square starting with a string of n 1's.A034979
Smallest square starting with a string of n 1's.
- a(n)^2 is smallest positive square starting with a string of n 2's.A034980
a(n)^2 is smallest positive square starting with a string of n 2's.
- Smallest square starting with a string of n 2's.A034981
Smallest square starting with a string of n 2's.
- a(n)^2 is smallest square starting with a string of n 3's.A034982
a(n)^2 is smallest square starting with a string of n 3's.
- Smallest square starting with a string of n 3's.A034983
Smallest square starting with a string of n 3's.
- a(n)^2 is smallest square starting with a string of n 4's.A034984
a(n)^2 is smallest square starting with a string of n 4's.
- Smallest square starting with a string of n 4's.A034985
Smallest square starting with a string of n 4's.
- a(n)^2 is smallest square number starting with a string of n 5's.A034986
a(n)^2 is smallest square number starting with a string of n 5's.
- Smallest square starting with a string of n 5's.A034987
Smallest square starting with a string of n 5's.
- a(n) is root of smallest square starting with a string of n 'digit_6's.A034988
a(n) is root of smallest square starting with a string of n 'digit_6's.
- Smallest squares starting with a string of n 6's.A034989
Smallest squares starting with a string of n 6's.
- a(n)^2 is smallest square starting with a string of n 7's.A034990
a(n)^2 is smallest square starting with a string of n 7's.
- Smallest square starting with a string of n 7's.A034991
Smallest square starting with a string of n 7's.
- a(n)^2 is smallest square number starting with a string of n 8's.A034992
a(n)^2 is smallest square number starting with a string of n 8's.
- Smallest square starting with a string of n 8's.A034993
Smallest square starting with a string of n 8's.
- Square root of smallest square starting with a string of n 9's.A034994
Square root of smallest square starting with a string of n 9's.
- Smallest square starting with a string of n 9's.A034995
Smallest square starting with a string of n 9's.
- Related to octo-factorial numbers A045755.A034996
Related to octo-factorial numbers A045755.
- Number of generalized retarded functions in quantum field theory.A034997
Number of generalized retarded functions in quantum field theory.
- Expansion of Product (1+q^(2k-1))^(-8)*(1+q^(4k))^(-8), k=1..inf.A034998
Expansion of Product (1+q^(2k-1))^(-8)*(1+q^(4k))^(-8), k=1..inf.
- Number of ways to cut a 2 X n rectangle into rectangles with integer sides.A034999
Number of ways to cut a 2 X n rectangle into rectangles with integer sides.
- Nontrivial trinomial coefficients.A035000
Nontrivial trinomial coefficients.
- Sorted elements of table (A035002) of a(m,n) = sum(a(m-k,n), k=1..m-1)+sum(a(m,n-k), k=1..n-1).A035001
Sorted elements of table (A035002) of a(m,n) = sum(a(m-k,n), k=1..m-1)+sum(a(m,n-k), k=1..n-1).
- Square array read by antidiagonals: T(m,n) = Sum_{k=1..m-1} T(m-k,n) + Sum_{k=1..n-1} T(m,n-k).A035002
Square array read by antidiagonals: T(m,n) = Sum_{k=1..m-1} T(m-k,n) + Sum_{k=1..n-1} T(m,n-k).
- Sorted entries in triangle in A014784.A035003
Sorted entries in triangle in A014784.
- Number of divisors of the n-th nonprime.A035004
Number of divisors of the n-th nonprime.
- Number of possible queen moves on an n X n chessboard.A035005
Number of possible queen moves on an n X n chessboard.
- Number of possible rook moves on an n X n chessboard.A035006
Number of possible rook moves on an n X n chessboard.
- Duplicate of A002492.A035007
Duplicate of A002492.
- Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.A035008
Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.
- STIRLING transform of [1,1,2,4,8,16,32,...].A035009
STIRLING transform of [1,1,2,4,8,16,32,...].
- Number of prime binary rooted trees with n external nodes.A035010
Number of prime binary rooted trees with n external nodes.