Sequences
392,541 sequences
- a(n) = n - (reversal of base-11 digits of n) (written in base 10).A055961
a(n) = n - (reversal of base-11 digits of n) (written in base 10).
- n + reversal of base 12 digits of n (written in base 10).A055962
n + reversal of base 12 digits of n (written in base 10).
- n - reversal of base 12 digits of n (written in base 10).A055963
n - reversal of base 12 digits of n (written in base 10).
- n + reversal of hexadecimal (base 16) digits of n (written in base 10).A055964
n + reversal of hexadecimal (base 16) digits of n (written in base 10).
- n - reversal of hexadecimal (base 16) digits of n (written in base 10).A055965
n - reversal of hexadecimal (base 16) digits of n (written in base 10).
- n + reversal of base 20 digits of n (written in base 10).A055966
n + reversal of base 20 digits of n (written in base 10).
- n - reversal of base 20 digits of n (written in base 10).A055967
n - reversal of base 20 digits of n (written in base 10).
- Product_{i=1..n} (i-1)!*(i+2*n-1)!/(i+n-1)!.A055968
Product_{i=1..n} (i-1)!*(i+2*n-1)!/(i+n-1)!.
- Number of unlabeled digraphs with n nodes and an odd number of arcs.A055969
Number of unlabeled digraphs with n nodes and an odd number of arcs.
- Nonprime numbers k such that k | sigma_3(k) + phi(k)^3.A055970
Nonprime numbers k such that k | sigma_3(k) + phi(k)^3.
- Numbers k such that k | (sigma(k) - d(k) - phi(k)) and k is not a prime or twice a prime.A055971
Numbers k such that k | (sigma(k) - d(k) - phi(k)) and k is not a prime or twice a prime.
- Continued fraction for the number 1 + 1/(e + 1/(e^2 + 1/(e^3 + 1/(e^4 +...)))).A055972
Continued fraction for the number 1 + 1/(e + 1/(e^2 + 1/(e^3 + 1/(e^4 +...)))).
- Number of unlabeled digraphs with loops (relations) on n nodes and with an even number of arcs.A055973
Number of unlabeled digraphs with loops (relations) on n nodes and with an even number of arcs.
- Number of unlabeled digraphs with loops (relations) on n nodes and with an odd number of arcs.A055974
Number of unlabeled digraphs with loops (relations) on n nodes and with an odd number of arcs.
- First differences of A003188 (decimal equivalent of the Gray Code).A055975
First differences of A003188 (decimal equivalent of the Gray Code).
- Remainder when (n-1)! + 1 is divided by n.A055976
Remainder when (n-1)! + 1 is divided by n.
- Numbers k such that Product_{q|k} p(q) divides p(k), where p(k) is number of unrestricted partitions of k and the product is over all distinct primes q that divide k.A055977
Numbers k such that Product_{q|k} p(q) divides p(k), where p(k) is number of unrestricted partitions of k and the product is over all distinct primes q that divide k.
- A sequence related to Ramanujan's tau function.A055978
A sequence related to Ramanujan's tau function.
- Solutions (value of r) of the Diophantine equation 2*x^2 + 3*x + 2 = r^2.A055979
Solutions (value of r) of the Diophantine equation 2*x^2 + 3*x + 2 = r^2.
- a(n) = floor(Sum_{i=1..n} 1/i).A055980
a(n) = floor(Sum_{i=1..n} 1/i).
- a(n) = ceiling(n!/d(n!)).A055981
a(n) = ceiling(n!/d(n!)).
- a(n+1) = a(n) converted to base 10 from base 11.A055982
a(n+1) = a(n) converted to base 10 from base 11.
- a(n+1) = a(n) converted to base 10 from base 12.A055983
a(n+1) = a(n) converted to base 10 from base 12.
- a(n+1) = a(n) converted to base 10 from base 13.A055984
a(n+1) = a(n) converted to base 10 from base 13.
- a(n+1) = a(n) converted to base 10 from base 14.A055985
a(n+1) = a(n) converted to base 10 from base 14.
- a(n+1) = a(n) converted to base 10 from base 15.A055986
a(n+1) = a(n) converted to base 10 from base 15.
- a(n+1) = a(n) converted to base 10 from base 16.A055987
a(n+1) = a(n) converted to base 10 from base 16.
- Sequence is its own 4th difference.A055988
Sequence is its own 4th difference.
- a(n) is its own 4th difference.A055989
a(n) is its own 4th difference.
- a(n) is its own 4th difference.A055990
a(n) is its own 4th difference.
- a(n) is its own 4th difference.A055991
a(n) is its own 4th difference.
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...A055992
n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...
- Number of square divisors of n!.A055993
Number of square divisors of n!.
- Expansion of (1+6x)/(1-x)^10.A055994
Expansion of (1+6x)/(1-x)^10.
- a(n) = 64*9^(n-2), a(0)=1, a(1)=7.A055995
a(n) = 64*9^(n-2), a(0)=1, a(1)=7.
- a(n) = 81*10^(n-2), a(0)=1, a(1)=8.A055996
a(n) = 81*10^(n-2), a(0)=1, a(1)=8.
- Numbers k such that k*(k - 1)/2 is a square.A055997
Numbers k such that k*(k - 1)/2 is a square.
- a(n) = n*(n+5)/2.A055998
a(n) = n*(n+5)/2.
- a(n) = n*(n + 7)/2.A055999
a(n) = n*(n + 7)/2.
- a(n) = n*(n+9)/2.A056000
a(n) = n*(n+9)/2.
- a(n) = (n+1)*binomial(n+7, 7).A056001
a(n) = (n+1)*binomial(n+7, 7).
- a(n) = (10^2)*11^(n-2); a(0)=1, a(1)=9.A056002
a(n) = (10^2)*11^(n-2); a(0)=1, a(1)=9.
- a(n) = (n+1)*binomial(n+8, 8).A056003
a(n) = (n+1)*binomial(n+8, 8).
- Initial step in Goodstein sequences: write n in hereditary representation base 2, bump to base 3, then subtract 1.A056004
Initial step in Goodstein sequences: write n in hereditary representation base 2, bump to base 3, then subtract 1.
- Number of 3-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 3 labeled nodes and n hyperedges.A056005
Number of 3-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 3 labeled nodes and n hyperedges.
- Numbers k such that k | sigma(k) + 2.A056006
Numbers k such that k | sigma(k) + 2.
- Difference between 2^n and largest square strictly less than 2^n.A056007
Difference between 2^n and largest square strictly less than 2^n.
- Difference between (smallest square strictly greater than 2^n) and 2^n.A056008
Difference between (smallest square strictly greater than 2^n) and 2^n.
- a(n) = (n^n + 1)/ (n^(2^a) + 1), where 2^a is the highest power of 2 dividing n.A056009
a(n) = (n^n + 1)/ (n^(2^a) + 1), where 2^a is the highest power of 2 dividing n.
- Number of words of length n in a simple grammar.A056010
Number of words of length n in a simple grammar.