Sequences
392,541 sequences
- Ramanujan's function F_5(q).A064511
Ramanujan's function F_5(q).
- Ramanujan's function F_7(q).A064512
Ramanujan's function F_7(q).
- Maximal number of nodes in graph of degree <= n and diameter 2 (another version).A064513
Maximal number of nodes in graph of degree <= n and diameter 2 (another version).
- Write A064476(n) = 2^i(n)*3^j(n); sequence gives values of i(n).A064514
Write A064476(n) = 2^i(n)*3^j(n); sequence gives values of i(n).
- Write A064476(n) = 2^i(n)*3^j(n); sequence gives values of j(n).A064515
Write A064476(n) = 2^i(n)*3^j(n); sequence gives values of j(n).
- Numbers k such that pi(k^2) is prime.A064516
Numbers k such that pi(k^2) is prime.
- Numbers k such that pi(k) is a square.A064517
Numbers k such that pi(k) is a square.
- For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.A064518
For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.
- Numbers k such that usigma(k) / tau(k) is prime.A064519
Numbers k such that usigma(k) / tau(k) is prime.
- a(n) = + 1 - 2 - 3 + 4 + 5 + 6 - 7 - 8 - 9 - 10 + 11 + 12 + 13 + 14 + 15 - ... + (+-1)*n, where there is one plus, two minuses, three pluses, etc. (see A002024).A064520
a(n) = + 1 - 2 - 3 + 4 + 5 + 6 - 7 - 8 - 9 - 10 + 11 + 12 + 13 + 14 + 15 - ... + (+-1)*n, where there is one plus, two minuses, three pluses, etc. (see A002024).
- Number of rooted 5-connected planar triangulations with 2n faces.A064521
Number of rooted 5-connected planar triangulations with 2n faces.
- For an integer n with prime factorization p1*p2*p3* ... *pn let n* = (p1-1)*(p2-1)*(p3-1)* ... *(pn-1) (A003958); sequence gives n such that n is divisible by n*.A064522
For an integer n with prime factorization p1*p2*p3* ... *pn let n* = (p1-1)*(p2-1)*(p3-1)* ... *(pn-1) (A003958); sequence gives n such that n is divisible by n*.
- Numbers m such that pi(m^2) is a square.A064523
Numbers m such that pi(m^2) is a square.
- Number of noncubes <= n.A064524
Number of noncubes <= n.
- Smallest Fibonacci number with a prime number of decimal digits.A064525
Smallest Fibonacci number with a prime number of decimal digits.
- Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = p(n) and A064183(n) = q(n).A064526
Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = p(n) and A064183(n) = q(n).
- Numbers k such that there exists a finite group G of order k such that all entries in its character table are integers.A064527
Numbers k such that there exists a finite group G of order k such that all entries in its character table are integers.
- Positive numbers that do not appear in A064520.A064528
Positive numbers that do not appear in A064520.
- Number of connected components remaining when n-th letter of English alphabet is cut from a piece of paper.A064529
Number of connected components remaining when n-th letter of English alphabet is cut from a piece of paper.
- Number of holes in n-th capital letter of English alphabet.A064530
Number of holes in n-th capital letter of English alphabet.
- Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.A064531
Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.
- Total number of holes in decimal expansion of the number n, assuming 4 has no hole.A064532
Total number of holes in decimal expansion of the number n, assuming 4 has no hole.
- Decimal expansion of Landau-Ramanujan constant.A064533
Decimal expansion of Landau-Ramanujan constant.
- If p >= 11 is prime, n is a power of one of the primes in this sequence but n is not a power of p, then the equation x^p + y^p = n*z^p has no solution in integers x,y,z.A064534
If p >= 11 is prime, n is a power of one of the primes in this sequence but n is not a power of p, then the equation x^p + y^p = n*z^p has no solution in integers x,y,z.
- a(n) = (2^prime(n)-2)/prime(n); a(0) = 0 by convention.A064535
a(n) = (2^prime(n)-2)/prime(n); a(0) = 0 by convention.
- a(n) = (4^n mod 3^n) mod 2^n.A064536
a(n) = (4^n mod 3^n) mod 2^n.
- Limit of the recursion B_[k] = P[k](B_[k-1]), where B_[0] = (1,2,3,4,5,...) and P[k] is the permutation that permutes the entries k+j and 2k + j for all j = 1,..,k.A064537
Limit of the recursion B_[k] = P[k](B_[k-1]), where B_[0] = (1,2,3,4,5,...) and P[k] is the permutation that permutes the entries k+j and 2k + j for all j = 1,..,k.
- a(n) is the smallest positive integer such that a(n)*(1^n + 2^n + ... + x^n) is a polynomial in x with integer coefficients.A064538
a(n) is the smallest positive integer such that a(n)*(1^n + 2^n + ... + x^n) is a polynomial in x with integer coefficients.
- Numbers n such that 2^n + n^2 is prime.A064539
Numbers n such that 2^n + n^2 is prime.
- Leading digits in A064541.A064540
Leading digits in A064541.
- Numbers k such that 2^k ends in k.A064541
Numbers k such that 2^k ends in k.
- a(n) = Max { k | k! <= n! / k! } where m! = A000142(m), factorial.A064542
a(n) = Max { k | k! <= n! / k! } where m! = A000142(m), factorial.
- Lesser of two consecutive primes such that p + n*q is a perfect square, p < q.A064543
Lesser of two consecutive primes such that p + n*q is a perfect square, p < q.
- Biquanimous numbers (or biquams): group the digits into two pieces (not necessarily equal or in order) with the same sum.A064544
Biquanimous numbers (or biquams): group the digits into two pieces (not necessarily equal or in order) with the same sum.
- Lesser of two consecutive primes such that n*p + q is a perfect square, p < q.A064545
Lesser of two consecutive primes such that n*p + q is a perfect square, p < q.
- Remainder when (n!)^2 is divided by n^n.A064546
Remainder when (n!)^2 is divided by n^n.
- Sum of binary digits (or count of 1-bits) in the exponents of the prime factorization of n.A064547
Sum of binary digits (or count of 1-bits) in the exponents of the prime factorization of n.
- Numbers k for which the sum of the binary digits equals the number of prime factors of k + 1 counted with multiplicity.A064548
Numbers k for which the sum of the binary digits equals the number of prime factors of k + 1 counted with multiplicity.
- a(n) = n * Product_{primes p|n} p.A064549
a(n) = n * Product_{primes p|n} p.
- a(1) = 2, a(n)=a(n-1)+2*Q(n)-n, n > 1 where Q = A005185.A064550
a(1) = 2, a(n)=a(n-1)+2*Q(n)-n, n > 1 where Q = A005185.
- Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.A064551
Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.
- a(0) = 1, a(n) = a(n-1) + 2*q(n) - n for n > 0, where q(n) = A064657(n) = q(|n-q(n-3)|) + q(|n-q(n-4)|) for n > 3, q(n) = 1 for n = 0, 1, 2, 3.A064552
a(0) = 1, a(n) = a(n-1) + 2*q(n) - n for n > 0, where q(n) = A064657(n) = q(|n-q(n-3)|) + q(|n-q(n-4)|) for n > 3, q(n) = 1 for n = 0, 1, 2, 3.
- a(1) = 1, a(prime(i)) = i + 1 for i > 0 and a(u * v) = a(u) * a(v) for u, v > 0.A064553
a(1) = 1, a(prime(i)) = i + 1 for i > 0 and a(u * v) = a(u) * a(v) for u, v > 0.
- a(n) = Min {k | A064553(k) = n}.A064554
a(n) = Min {k | A064553(k) = n}.
- a(n) = max { k | A064553(k) = n }.A064555
a(n) = max { k | A064553(k) = n }.
- Ramanujan's tau function (or tau numbers (A000594)) for 10^n.A064556
Ramanujan's tau function (or tau numbers (A000594)) for 10^n.
- a(n) = # { p | A064553(k) = p prime and k <= n}.A064557
a(n) = # { p | A064553(k) = p prime and k <= n}.
- a(n) = A064553(A064553(n)).A064558
a(n) = A064553(A064553(n)).
- Number of iterations in A064553 to reach a fixed point.A064559
Number of iterations in A064553 to reach a fixed point.
- Numbers n such that reciprocal of n terminates with an infinite repetition of digit 1. Multiples of 10 are omitted.A064560
Numbers n such that reciprocal of n terminates with an infinite repetition of digit 1. Multiples of 10 are omitted.