Sequences
392,541 sequences
- Squares composed of digits {4,6,9}.A053961
Squares composed of digits {4,6,9}.
- Numbers k such that k^2 contains only digits {4,7,8}.A053962
Numbers k such that k^2 contains only digits {4,7,8}.
- Squares composed of digits {4,7,8}.A053963
Squares composed of digits {4,7,8}.
- Numbers k such that k^2 contains only digits {4,7,9}.A053964
Numbers k such that k^2 contains only digits {4,7,9}.
- Squares composed of digits {4,7,9}.A053965
Squares composed of digits {4,7,9}.
- Numbers k such that k^2 contains only digits {4,8,9}.A053966
Numbers k such that k^2 contains only digits {4,8,9}.
- Squares composed of digits {4,8,9}.A053967
Squares composed of digits {4,8,9}.
- Numbers k such that k^2 contains only digits {5,6,7}.A053968
Numbers k such that k^2 contains only digits {5,6,7}.
- Squares composed of digits {5,6,7}.A053969
Squares composed of digits {5,6,7}.
- Numbers k such that k^2 contains only digits {5,6,9}.A053970
Numbers k such that k^2 contains only digits {5,6,9}.
- Squares composed of digits {5,6,9}.A053971
Squares composed of digits {5,6,9}.
- Numbers k such that k^2 contains only digits {6,7,9}.A053972
Numbers k such that k^2 contains only digits {6,7,9}.
- Squares composed of digits {6,7,9}.A053973
Squares composed of digits {6,7,9}.
- Numbers k such that k^2 contains only digits {6,8,9}.A053974
Numbers k such that k^2 contains only digits {6,8,9}.
- Squares composed of digits {6,8,9}.A053975
Squares composed of digits {6,8,9}.
- Least number such that a(n) and nextprime(a(n)) differ by at least a power of 10, 10^m, where m >= n.A053976
Least number such that a(n) and nextprime(a(n)) differ by at least a power of 10, 10^m, where m >= n.
- Engel expansion of the Euler-Mascheroni constant gamma A001620 = 0.57721566... .A053977
Engel expansion of the Euler-Mascheroni constant gamma A001620 = 0.57721566... .
- Continued fraction expansion of limit_{m->infinity} [r_m], where r_1=1, r_{m+1}= r_1 + 1/(r_2 + 1/(r_3 +...1/(r_{m-1} + 1/r_m)...)).A053978
Continued fraction expansion of limit_{m->infinity} [r_m], where r_1=1, r_{m+1}= r_1 + 1/(r_2 + 1/(r_3 +...1/(r_{m-1} + 1/r_m)...)).
- Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).A053979
Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).
- Engel expansion of zeta(3) = 1.20206... .A053980
Engel expansion of zeta(3) = 1.20206... .
- A fourth order generalization of the Mobius function of n.A053981
A fourth order generalization of the Mobius function of n.
- Numbers k such that 1 + product of first k composite numbers is prime.A053982
Numbers k such that 1 + product of first k composite numbers is prime.
- a(n) = (2*n-1)*a(n-1) - a(n-2), a(0)=a(1)=1.A053983
a(n) = (2*n-1)*a(n-1) - a(n-2), a(0)=a(1)=1.
- a(n) = (2*n-1)*a(n-1) - a(n-2), a(0) = 0, a(1) = 1.A053984
a(n) = (2*n-1)*a(n-1) - a(n-2), a(0) = 0, a(1) = 1.
- Replace 2^k with (-2)^k in binary expansion of n.A053985
Replace 2^k with (-2)^k in binary expansion of n.
- a(n) = n^(n!).A053986
a(n) = n^(n!).
- Numerators of successive convergents to tan(1/2) using continued fraction 1/(2-1/(6-1/(10-1/(14-1/(18-1/(22-1/(26-1/30-...))))))).A053987
Numerators of successive convergents to tan(1/2) using continued fraction 1/(2-1/(6-1/(10-1/(14-1/(18-1/(22-1/(26-1/30-...))))))).
- Denominators of successive convergents to tan(1/2) using continued fraction 1/(2-1/(6-1/(10-1/(14-1/(18-1/(22-1/(26-1/30-...))))))).A053988
Denominators of successive convergents to tan(1/2) using continued fraction 1/(2-1/(6-1/(10-1/(14-1/(18-1/(22-1/(26-1/30-...))))))).
- Smallest k such that nk-1 is prime.A053989
Smallest k such that nk-1 is prime.
- Numbers of the form x*(x + 1)*y*(y + 1) ("bipronics") where x and y are distinct.A053990
Numbers of the form x*(x + 1)*y*(y + 1) ("bipronics") where x and y are distinct.
- Number of distinct residues of generalized Catalan number 1/((n^2-1)*k + 1)*binomial(n^2*k, k) modulo n^2 as k runs through the positive integers.A053991
Number of distinct residues of generalized Catalan number 1/((n^2-1)*k + 1)*binomial(n^2*k, k) modulo n^2 as k runs through the positive integers.
- The number phi_3(n) of Frobenius partitions that allow up to 3 repetitions of an integer in a row.A053992
The number phi_3(n) of Frobenius partitions that allow up to 3 repetitions of an integer in a row.
- The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.A053993
The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.
- Nonattacking queens on a 2n+1 X 2n+1 toroidal board, solutions which differ only by rotation, reflection or torus shift count only once.A053994
Nonattacking queens on a 2n+1 X 2n+1 toroidal board, solutions which differ only by rotation, reflection or torus shift count only once.
- Bases of n-dimensional vector space over GF(3).A053995
Bases of n-dimensional vector space over GF(3).
- Number of bases of n-dimensional vector space over GF(4).A053996
Number of bases of n-dimensional vector space over GF(4).
- Sum of primes in n-th shell of prime spiral.A053997
Sum of primes in n-th shell of prime spiral.
- Smallest prime in n-th shell of prime spiral.A053998
Smallest prime in n-th shell of prime spiral.
- Prime number spiral (clockwise, Northwest spoke).A053999
Prime number spiral (clockwise, Northwest spoke).
- a(n) = 2*n^2 - 2.A054000
a(n) = 2*n^2 - 2.
- Differences between numbers k such that k and k+1 have the same sum of divisors.A054001
Differences between numbers k such that k and k+1 have the same sum of divisors.
- Number of divisors of n such that n and n-1 have the same sum of divisors.A054002
Number of divisors of n such that n and n-1 have the same sum of divisors.
- tau(n+1) - tau(n) where n and n+1 have the same sum of divisors.A054003
tau(n+1) - tau(n) where n and n+1 have the same sum of divisors.
- Numbers k such that k and k+1 have the same number and sum of divisors.A054004
Numbers k such that k and k+1 have the same number and sum of divisors.
- Sum of divisors of k such that k and k+1 have the same number and sum of divisors.A054005
Sum of divisors of k such that k and k+1 have the same number and sum of divisors.
- Number of divisors of k and k+1 which have the same number and sum of divisors.A054006
Number of divisors of k and k+1 which have the same number and sum of divisors.
- Numbers k such that k and k+1 have the same sum but an unequal number of divisors.A054007
Numbers k such that k and k+1 have the same sum but an unequal number of divisors.
- n read modulo (number of divisors of n).A054008
n read modulo (number of divisors of n).
- n read modulo (number of proper divisors of n).A054009
n read modulo (number of proper divisors of n).
- Numbers n with property that n is divisible by the number of its proper divisors.A054010
Numbers n with property that n is divisible by the number of its proper divisors.