Sequences
392,541 sequences
- Form a triangle with the numbers [0..n] on the base, where each number is the sum of the two below; a(n) is the number of different possible values for the apex.A066411
Form a triangle with the numbers [0..n] on the base, where each number is the sum of the two below; a(n) is the number of different possible values for the apex.
- Number of elements in the set phi_inverse(phi(n)).A066412
Number of elements in the set phi_inverse(phi(n)).
- Eisenstein-Mersenne primes: primes of the form ((3 +/- sqrt(-3))/2)^p - 1.A066413
Eisenstein-Mersenne primes: primes of the form ((3 +/- sqrt(-3))/2)^p - 1.
- Numerators of coefficients in series expansion of -512*(1+x)^3/(x-8)^3.A066414
Numerators of coefficients in series expansion of -512*(1+x)^3/(x-8)^3.
- Denominators of coefficients in series expansion of -512*(1+x)^3/(x-8)^3.A066415
Denominators of coefficients in series expansion of -512*(1+x)^3/(x-8)^3.
- Number of numbers m such that the sum of the anti-divisors of m is n+1.A066416
Number of numbers m such that the sum of the anti-divisors of m is n+1.
- Sum of anti-divisors of n.A066417
Sum of anti-divisors of n.
- Numbers k for which phi(k) + anti-phi(k) = k.A066418
Numbers k for which phi(k) + anti-phi(k) = k.
- Numbers k such that k! is not divisible by the sum of the decimal digits of k!.A066419
Numbers k such that k! is not divisible by the sum of the decimal digits of k!.
- Least m such that card(invphi(phi(m)))=n.A066420
Least m such that card(invphi(phi(m)))=n.
- a(n) = least k > 0 such that sigma^(k)(n) + 1 is prime, if such k exists; otherwise 0, where sigma^(k) denotes application of sigma k times.A066421
a(n) = least k > 0 such that sigma^(k)(n) + 1 is prime, if such k exists; otherwise 0, where sigma^(k) denotes application of sigma k times.
- a(n) = least k such that phi^(k)(n) + 1 is prime, where phi^(k) denotes application of phi k times.A066422
a(n) = least k such that phi^(k)(n) + 1 is prime, where phi^(k) denotes application of phi k times.
- Composite numbers n such that the product of proper divisors of the n does not equal n.A066423
Composite numbers n such that the product of proper divisors of the n does not equal n.
- The n-digit number whose divisors have the maximal sum (A066410).A066424
The n-digit number whose divisors have the maximal sum (A066410).
- a(1) = 1; thereafter a(n) is the smallest number > a(n-1) such that a(n) minus any sum of distinct earlier terms is not already in the sequence.A066425
a(1) = 1; thereafter a(n) is the smallest number > a(n-1) such that a(n) minus any sum of distinct earlier terms is not already in the sequence.
- Conjectured values for a(n) = least natural number k such that phi(n+k) = phi(n) + phi(k), if k exists; otherwise 0.A066426
Conjectured values for a(n) = least natural number k such that phi(n+k) = phi(n) + phi(k), if k exists; otherwise 0.
- Numbers with mu = 0 and infinitary MoebiusMu = -1; (sum of binary digits of prime exponents is odd).A066427
Numbers with mu = 0 and infinitary MoebiusMu = -1; (sum of binary digits of prime exponents is odd).
- Numbers with mu = 0 and infinitary MoebiusMu = +1 (sum of binary digits of prime exponents is even).A066428
Numbers with mu = 0 and infinitary MoebiusMu = +1 (sum of binary digits of prime exponents is even).
- a(n) = 7^n mod n^7.A066429
a(n) = 7^n mod n^7.
- a(n) = 8^n mod n^8.A066430
a(n) = 8^n mod n^8.
- a(n) = 9^n mod n^9.A066431
a(n) = 9^n mod n^9.
- a(n) = 10^n mod n^10.A066432
a(n) = 10^n mod n^10.
- a(n) = floor(e^n mod n^e).A066433
a(n) = floor(e^n mod n^e).
- a(n) = floor(Pi^n mod n^Pi).A066434
a(n) = floor(Pi^n mod n^Pi).
- Conjectured values for a(n) = least natural number k such that sigma(n+k) = sigma(n)+sigma(k) if it exists; otherwise 0.A066435
Conjectured values for a(n) = least natural number k such that sigma(n+k) = sigma(n)+sigma(k) if it exists; otherwise 0.
- Primes of the form 2*n^2 - 1.A066436
Primes of the form 2*n^2 - 1.
- a(n) = max_{k} {T(n,k)} where T(n,k) is the "phi/sigma tug-of-war sequence with seed n" defined by T(n,1) = phi(n), T(n,2) = sigma(phi(n)), T(n,3) = phi(sigma(phi(n))), ..., T(n,k) = phi(T(n,k-1)) if k is odd and = sigma(T(n,k-1)) if k is even.A066437
a(n) = max_{k} {T(n,k)} where T(n,k) is the "phi/sigma tug-of-war sequence with seed n" defined by T(n,1) = phi(n), T(n,2) = sigma(phi(n)), T(n,3) = phi(sigma(phi(n))), ..., T(n,k) = phi(T(n,k-1)) if k is odd and = sigma(T(n,k-1)) if k is even.
- a(n) = 7^n mod n.A066438
a(n) = 7^n mod n.
- a(n) = 8^n mod n.A066439
a(n) = 8^n mod n.
- a(n) = 9^n mod n.A066440
a(n) = 9^n mod n.
- a(n) = 11^n mod n.A066441
a(n) = 11^n mod n.
- a(n) = 12^n mod n.A066442
a(n) = 12^n mod n.
- Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.A066443
Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.
- a(n) = 11^n mod n^11.A066444
a(n) = 11^n mod n^11.
- a(n) = 12^n mod n^12.A066445
a(n) = 12^n mod n^12.
- Number of unordered divisor pairs of n.A066446
Number of unordered divisor pairs of n.
- Number of basis partitions (or basic partitions) of n.A066447
Number of basis partitions (or basic partitions) of n.
- Triangle T(n,k) giving number of basis partitions of n with a Durfee square of order k (n >= 0, 0 <= k <= n).A066448
Triangle T(n,k) giving number of basis partitions of n with a Durfee square of order k (n >= 0, 0 <= k <= n).
- Binomial(n, phi(n)), where phi(n) is the Euler totient function.A066449
Binomial(n, phi(n)), where phi(n) is the Euler totient function.
- a(n) is the conjectured value of the minimal number to which repeated application of the "reverse and add!" algorithm in base n does not terminate in a palindrome. If there is no such number in base n, then a(n) := -1.A066450
a(n) is the conjectured value of the minimal number to which repeated application of the "reverse and add!" algorithm in base n does not terminate in a palindrome. If there is no such number in base n, then a(n) := -1.
- a(n) is the number of integers k > 0 such that (n*k+1)/(k^2+1) is an integer.A066451
a(n) is the number of integers k > 0 such that (n*k+1)/(k^2+1) is an integer.
- Anti-phi(n).A066452
Anti-phi(n).
- Number of 3-dimensional polyominoes (or polycubes) with n cells and trivial rotational symmetry group.A066453
Number of 3-dimensional polyominoes (or polycubes) with n cells and trivial rotational symmetry group.
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 2.A066454
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 2.
- a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.A066455
a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.
- Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).A066456
Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).
- Numbers k such that product of factorials of digits of k equals pi(k) (A000720).A066457
Numbers k such that product of factorials of digits of k equals pi(k) (A000720).
- Numbers n such that Sum_{d runs through digits of n} d^d = pi(n) (cf. A000720).A066458
Numbers n such that Sum_{d runs through digits of n} d^d = pi(n) (cf. A000720).
- Product of factorials of the digits of n.A066459
Product of factorials of the digits of n.
- a(n) is the least positive integer k such that k is a repdigit number in exactly n different bases B, where 1<B<k.A066460
a(n) is the least positive integer k such that k is a repdigit number in exactly n different bases B, where 1<B<k.