Sequences
392,541 sequences
- a(n) = (3*n - 1)!*n/2.A065961
a(n) = (3*n - 1)!*n/2.
- a(1) = 1, a(n) = a(n - 1) + pi(a(n - 1)) + 1.A065962
a(1) = 1, a(n) = a(n - 1) + pi(a(n - 1)) + 1.
- Smallest number which is digitally balanced in n bases, for 2 <= base b <= a(n).A065963
Smallest number which is digitally balanced in n bases, for 2 <= base b <= a(n).
- a(n) is the smallest k such that (k^3 + 1)/(n^3 + 1) is an integer > 1.A065964
a(n) is the smallest k such that (k^3 + 1)/(n^3 + 1) is an integer > 1.
- Numbers k that divide A039916(k).A065965
Numbers k that divide A039916(k).
- Numbers k such that phi(k) / 2 is prime.A065966
Numbers k such that phi(k) / 2 is prime.
- a(n) = n * Sum_{primes p dividing n} (1 + 1/p).A065967
a(n) = n * Sum_{primes p dividing n} (1 + 1/p).
- a(n) = n * Sum_{primes p dividing n} (1 - 1/p).A065968
a(n) = n * Sum_{primes p dividing n} (1 - 1/p).
- a(n) = n^2 * Sum_{primes p dividing n} (1 + 1/p^2).A065969
a(n) = n^2 * Sum_{primes p dividing n} (1 + 1/p^2).
- a(n) = n^2 * Sum_{primes p dividing n} (1 - 1/p^2).A065970
a(n) = n^2 * Sum_{primes p dividing n} (1 - 1/p^2).
- Binomial transform of A064413.A065971
Binomial transform of A064413.
- Inverse binomial transform of A064413.A065972
Inverse binomial transform of A064413.
- Denominators in an asymptotic expansion of Ramanujan.A065973
Denominators in an asymptotic expansion of Ramanujan.
- Numerators in expansion of (exp(x)-1)^3.A065974
Numerators in expansion of (exp(x)-1)^3.
- Denominators in expansion of (exp(x)-1)^3.A065975
Denominators in expansion of (exp(x)-1)^3.
- Consecutive terms of A065966 which are also consecutive integers.A065976
Consecutive terms of A065966 which are also consecutive integers.
- Numbers k that divide the number formed by the first k decimal digits of e (A039920(k)).A065977
Numbers k that divide the number formed by the first k decimal digits of e (A039920(k)).
- For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.A065978
For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.
- Binomial transform of A002024.A065979
Binomial transform of A002024.
- Inverse binomial transform of [1^1,2^2,3^3,...], shifted right by one index.A065980
Inverse binomial transform of [1^1,2^2,3^3,...], shifted right by one index.
- Best approximation of the remainder in the zeta(4) series using the remainder in the zeta(3) series.A065981
Best approximation of the remainder in the zeta(4) series using the remainder in the zeta(3) series.
- a(n) = (n+1)*binomial(2*n,n) - 2^(2*n-1).A065982
a(n) = (n+1)*binomial(2*n,n) - 2^(2*n-1).
- Palindromes whose digit sum is 4.A065983
Palindromes whose digit sum is 4.
- Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n.A065984
Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n.
- Numbers k such that d(k) / 2 is prime, where d(k) = number of divisors of k.A065985
Numbers k such that d(k) / 2 is prime, where d(k) = number of divisors of k.
- Numbers k such that sigma(k) = phi(k+1) + phi(k) + phi(k-1).A065986
Numbers k such that sigma(k) = phi(k+1) + phi(k) + phi(k-1).
- Numbers k such that the first k binary digits of Pi expressed in decimal forms a prime.A065987
Numbers k such that the first k binary digits of Pi expressed in decimal forms a prime.
- a(n) is the largest prime p < n such that n mod p is a perfect square; a(n) = 0 if no such prime exists.A065988
a(n) is the largest prime p < n such that n mod p is a perfect square; a(n) = 0 if no such prime exists.
- Numbers k such that the first k ternary digits of Pi expressed in decimal forms a prime.A065989
Numbers k such that the first k ternary digits of Pi expressed in decimal forms a prime.
- Numbers k such that the first k base-5 digits of Pi expressed in decimal forms a prime.A065990
Numbers k such that the first k base-5 digits of Pi expressed in decimal forms a prime.
- Numbers k such that the first k base-4 digits of Pi expressed in decimal forms a prime.A065991
Numbers k such that the first k base-4 digits of Pi expressed in decimal forms a prime.
- Numbers k such that the sum of the nonsquare numbers from 1 to k is a square.A065992
Numbers k such that the sum of the nonsquare numbers from 1 to k is a square.
- Numbers k such that the first k base-6 digits of Pi (A004605) expressed in decimal forms a prime.A065993
Numbers k such that the first k base-6 digits of Pi (A004605) expressed in decimal forms a prime.
- a(n) = prime(prime(n) - n).A065994
a(n) = prime(prime(n) - n).
- a(n) = prime(prime(n) + n).A065995
a(n) = prime(prime(n) + n).
- a(n) = prime(prime(n) mod n).A065996
a(n) = prime(prime(n) mod n).
- Numbers n such that sigma(n) / n is prime.A065997
Numbers n such that sigma(n) / n is prime.
- Concatenate n and number of divisors of n.A065998
Concatenate n and number of divisors of n.
- Sum of digits of 9^n.A065999
Sum of digits of 9^n.
- Size of smallest directed 1-covering code of length n.A066000
Size of smallest directed 1-covering code of length n.
- Sum of digits of 5^n.A066001
Sum of digits of 5^n.
- Sum of digits of 6^n.A066002
Sum of digits of 6^n.
- Sum of digits of 7^n.A066003
Sum of digits of 7^n.
- Sum of digits of 8^n.A066004
Sum of digits of 8^n.
- Sum of digits of 11^n.A066005
Sum of digits of 11^n.
- Sum of digits of 12^n.A066006
Sum of digits of 12^n.
- a(n) is that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest.A066007
a(n) is that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest.
- Number of n-digit positive integers m for which m/(sum of digits of m) is an integer, sometimes referred to as Niven or Harshad numbers.A066008
Number of n-digit positive integers m for which m/(sum of digits of m) is an integer, sometimes referred to as Niven or Harshad numbers.
- Covering numbers C(n,7,6).A066009
Covering numbers C(n,7,6).
- Triangle of covering numbers T(n,k) = C(n,k,k-1), n >= 2, 2 <= k <= n.A066010
Triangle of covering numbers T(n,k) = C(n,k,k-1), n >= 2, 2 <= k <= n.