Sequences
392,541 sequences
- Numbers k such that sigma(k) divides sigma(sigma(k)).A066961
Numbers k such that sigma(k) divides sigma(sigma(k)).
- Duplicate of A051913.A066962
Duplicate of A051913.
- Start of a record-breaking run of consecutive composite integers with an odd number of prime factors.A066963
Start of a record-breaking run of consecutive composite integers with an odd number of prime factors.
- Duplicate of A066967.A066964
Duplicate of A066967.
- Duplicate of A066966.A066965
Duplicate of A066966.
- Total sum of even parts in all partitions of n.A066966
Total sum of even parts in all partitions of n.
- Total sum of odd parts in all partitions of n.A066967
Total sum of odd parts in all partitions of n.
- Denominators of b(n) = (1/16)^n*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).A066968
Denominators of b(n) = (1/16)^n*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).
- Numbers k such that Sum_{i=1..k} phi(i)/gcd(k,i) is an integer.A066969
Numbers k such that Sum_{i=1..k} phi(i)/gcd(k,i) is an integer.
- Integers of the form Sum_{i=1..m} phi(i)/gcd(m,i).A066970
Integers of the form Sum_{i=1..m} phi(i)/gcd(m,i).
- a(n) = sigma(sigma(sigma(n))).A066971
a(n) = sigma(sigma(sigma(n))).
- Duplicate of A067819.A066972
Duplicate of A067819.
- a(n) = phi(binomial(2n, n)).A066973
a(n) = phi(binomial(2n, n)).
- Integers of the form (1/m)*sum(i=1,m,binomial(2i,i)).A066974
Integers of the form (1/m)*sum(i=1,m,binomial(2i,i)).
- a(n) = gcd(binomial(2n,n), 2^n + 1).A066975
a(n) = gcd(binomial(2n,n), 2^n + 1).
- a(0) = 1; for n>0: a(n) = sum{a(i)*n^i : 0<=i<n}.A066976
a(0) = 1; for n>0: a(n) = sum{a(i)*n^i : 0<=i<n}.
- a(n) = gcd(prime(n^2) + 1, prime(n) + 1).A066977
a(n) = gcd(prime(n^2) + 1, prime(n) + 1).
- a(n) = gcd(prime(2*n)+1, prime(n)+1).A066978
a(n) = gcd(prime(2*n)+1, prime(n)+1).
- a(n) = floor(n!/2^n).A066979
a(n) = floor(n!/2^n).
- Numbers k such that antid(k) > antid(k+1) and santid(k) > santid(k+1), where antid(k) = A066272 and santid(k) = A066417.A066980
Numbers k such that antid(k) > antid(k+1) and santid(k) > santid(k+1), where antid(k) = A066272 and santid(k) = A066417.
- Number of residues of Lucas numbers modulo n.A066981
Number of residues of Lucas numbers modulo n.
- a(n) = Lucas(n+1) - (n+1).A066982
a(n) = Lucas(n+1) - (n+1).
- a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.A066983
a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.
- a(n) = gcd(prime(n+1) - 1, prime(n) + 1).A066984
a(n) = gcd(prime(n+1) - 1, prime(n) + 1).
- Reflective numbers: k such that the decimal encoding of the prime factorization of k (A067599) is palindromic.A066985
Reflective numbers: k such that the decimal encoding of the prime factorization of k (A067599) is palindromic.
- Integers of the form (Product_{i=1..k} sigma(i))/(Product_{i=1..k} phi(i)) = A066780(k)/A001088(k).A066986
Integers of the form (Product_{i=1..k} sigma(i))/(Product_{i=1..k} phi(i)) = A066780(k)/A001088(k).
- a(n) = Product_{i=2..n} sigma(i)/bigomega(i).A066987
a(n) = Product_{i=2..n} sigma(i)/bigomega(i).
- a(n) = Product_{i=2..n} phi(i)/bigomega(i).A066988
a(n) = Product_{i=2..n} phi(i)/bigomega(i).
- a(n) = (n!)^3 * Sum_{i=1..n} 1/i^3.A066989
a(n) = (n!)^3 * Sum_{i=1..n} 1/i^3.
- In canonical prime factorization of n replace even exponents with 2 and odd exponents with 1.A066990
In canonical prime factorization of n replace even exponents with 2 and odd exponents with 1.
- Square array read by descending antidiagonals of number of ways of dividing n*k labeled items into k unlabeled orders with n items in each order.A066991
Square array read by descending antidiagonals of number of ways of dividing n*k labeled items into k unlabeled orders with n items in each order.
- Integers of the form C(2n,n)^2 * Sum_{i=1..n} 1/phi(i).A066992
Integers of the form C(2n,n)^2 * Sum_{i=1..n} 1/phi(i).
- Integer of the form phi(n)*sigma(n)/n.A066993
Integer of the form phi(n)*sigma(n)/n.
- Numbers k such that phi(k) divides k*sigma(k).A066994
Numbers k such that phi(k) divides k*sigma(k).
- Numbers k such that sigma(k) divides k*phi(k).A066995
Numbers k such that sigma(k) divides k*phi(k).
- Numbers n such that Sum_{i=2..n} 1/A001221(i) is an integer.A066996
Numbers n such that Sum_{i=2..n} 1/A001221(i) is an integer.
- Survivor number for 2nd-order Josephus problem.A066997
Survivor number for 2nd-order Josephus problem.
- a(0)=0; a(n) = n^2*a(n-1) + 1.A066998
a(0)=0; a(n) = n^2*a(n-1) + 1.
- a(n) = 3^n * Sum_{i=1..n} i^3/3^i.A066999
a(n) = 3^n * Sum_{i=1..n} i^3/3^i.
- a(1) = 1; a(n) = Sum (n+k)!a(k)/(2k)!, k = 1..n-1.A067000
a(1) = 1; a(n) = Sum (n+k)!a(k)/(2k)!, k = 1..n-1.
- Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).A067001
Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).
- Numerator of Sum_{k=0..n} 2^(k-2*n) * binomial(2*n-2*k,n-k) * binomial(n+k,n).A067002
Numerator of Sum_{k=0..n} 2^(k-2*n) * binomial(2*n-2*k,n-k) * binomial(n+k,n).
- Number of numbers <= n with same number of distinct prime factors as n.A067003
Number of numbers <= n with same number of distinct prime factors as n.
- Number of numbers <= n with same number of divisors as n.A067004
Number of numbers <= n with same number of divisors as n.
- Totient of A061026(n) divided by n.A067005
Totient of A061026(n) divided by n.
- Smallest number for which the totient is divisible by the n-th nontotient number, that is, the n-th term of A007617.A067006
Smallest number for which the totient is divisible by the n-th nontotient number, that is, the n-th term of A007617.
- a(n) = googolplex (mod n).A067007
a(n) = googolplex (mod n).
- Numbers k such that Sum_{j=1..k} A008472(j) divides k!.A067008
Numbers k such that Sum_{j=1..k} A008472(j) divides k!.
- Continued fraction expansion of Product_{p prime} (1 + 1/(p+1)^2).A067009
Continued fraction expansion of Product_{p prime} (1 + 1/(p+1)^2).
- a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 32 X 33 rectangle.A067010
a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 32 X 33 rectangle.