Sequences
392,541 sequences
- a(n) = A065810(n)-1.A065811
a(n) = A065810(n)-1.
- a(n) = A065811(n)/3.A065812
a(n) = A065811(n)/3.
- Least m such that (p^(2*m+1)-1)/(p-1) is a prime, where p = prime(n).A065813
Least m such that (p^(2*m+1)-1)/(p-1) is a prime, where p = prime(n).
- a(n) = tau(n)^2 - tau(n^2), where tau(n) = A000005(n).A065814
a(n) = tau(n)^2 - tau(n^2), where tau(n) = A000005(n).
- Numbers n such that initial n digits in decimal portion of the Euler-Mascheroni constant form a prime number.A065815
Numbers n such that initial n digits in decimal portion of the Euler-Mascheroni constant form a prime number.
- Numbers k such that the alternating sum of digits of k^2 is 0.A065816
Numbers k such that the alternating sum of digits of k^2 is 0.
- Numbers n such that sigma_5(n)/sigma_1(n) is prime.A065817
Numbers n such that sigma_5(n)/sigma_1(n) is prime.
- Numbers k such that 3*phi(k) = 2*sigma(k).A065818
Numbers k such that 3*phi(k) = 2*sigma(k).
- Numbers k such that 4*phi(k) = 3*sigma(k).A065819
Numbers k such that 4*phi(k) = 3*sigma(k).
- Numbers n such that sigma_6(n)/sigma_2(n) is prime.A065820
Numbers n such that sigma_6(n)/sigma_2(n) is prime.
- a(n) is the smallest prime ending in exactly n 1's.A065821
a(n) is the smallest prime ending in exactly n 1's.
- Numbers k such that 5*phi(k) = 4*sigma(k).A065822
Numbers k such that 5*phi(k) = 4*sigma(k).
- Numbers k such that 6*phi(k) = 5*sigma(k).A065823
Numbers k such that 6*phi(k) = 5*sigma(k).
- Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.A065824
Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.
- Smallest k such that n numbers may be picked in {1,...,k} with no three terms in arithmetic progression.A065825
Smallest k such that n numbers may be picked in {1,...,k} with no three terms in arithmetic progression.
- Triangle with T(n,k) = k*E(n,k) where E(n,k) are Eulerian numbers A008292.A065826
Triangle with T(n,k) = k*E(n,k) where E(n,k) are Eulerian numbers A008292.
- Sum of squares of divisors of square numbers.A065827
Sum of squares of divisors of square numbers.
- Binary digits found in decimal expansion of Pi.A065828
Binary digits found in decimal expansion of Pi.
- String formed from first n binary digits found in decimal expansion of Pi.A065829
String formed from first n binary digits found in decimal expansion of Pi.
- A065829 converted to base 10.A065830
A065829 converted to base 10.
- Primes found in A065830.A065831
Primes found in A065830.
- Numbers k such that the first k binary digits found in the base-10 expansion of Pi form a prime (when the decimal point is ignored).A065832
Numbers k such that the first k binary digits found in the base-10 expansion of Pi form a prime (when the decimal point is ignored).
- Ternary digits found in decimal expansion of Pi.A065833
Ternary digits found in decimal expansion of Pi.
- String formed from first n ternary digits found in decimal expansion of Pi.A065834
String formed from first n ternary digits found in decimal expansion of Pi.
- A065834 converted to base 10.A065835
A065834 converted to base 10.
- Quaternary digits found in decimal expansion of Pi.A065836
Quaternary digits found in decimal expansion of Pi.
- String formed from first n quaternary digits found in decimal expansion of Pi.A065837
String formed from first n quaternary digits found in decimal expansion of Pi.
- A065837 converted to base 10.A065838
A065837 converted to base 10.
- Primes found in A065838.A065839
Primes found in A065838.
- Numbers k such that the first k quaternary digits found in the base-10 expansion of Pi form a prime (when the decimal point is ignored).A065840
Numbers k such that the first k quaternary digits found in the base-10 expansion of Pi form a prime (when the decimal point is ignored).
- a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1).A065841
a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1).
- a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1); the digits on the right of the first 3 (if any) are then swapped with the digits on the left.A065842
a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1); the digits on the right of the first 3 (if any) are then swapped with the digits on the left.
- Let u be any string of n digits from {0,1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-2 number; then a(n) = max_u f(u).A065843
Let u be any string of n digits from {0,1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-2 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,1,2}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-3 number; then a(n) = max_u f(u).A065844
Let u be any string of n digits from {0,1,2}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-3 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,3}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-4 number; then a(n) = max_u f(u).A065845
Let u be any string of n digits from {0,...,3}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-4 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,4}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-5 number; then a(n) = max_u f(u).A065846
Let u be any string of n digits from {0,...,4}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-5 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,5}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-6 number; then a(n) = max_u f(u).A065847
Let u be any string of n digits from {0,...,5}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-6 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,6}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-7 number; then a(n) = max_u f(u).A065848
Let u be any string of n digits from {0,...,6}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-7 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,7}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-8 number; then a(n) = max_u f(u).A065849
Let u be any string of n digits from {0,...,7}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-8 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,8}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-9 number; then a(n) = max_u f(u).A065850
Let u be any string of n digits from {0,...,8}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-9 number; then a(n) = max_u f(u).
- Let u be any string of n digits from {0,...,9}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u; then a(n) = max_u f(u).A065851
Let u be any string of n digits from {0,...,9}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u; then a(n) = max_u f(u).
- Let u be any string of 3 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).A065852
Let u be any string of 3 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).
- Let u be any string of 4 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).A065853
Let u be any string of 4 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).
- Smallest prime q such that (p^q-1)/(p-1) is a prime, where p = prime(n).A065854
Smallest prime q such that (p^q-1)/(p-1) is a prime, where p = prime(n).
- Number of composites <= n.A065855
Number of composites <= n.
- The (2^n)-th composite number.A065856
The (2^n)-th composite number.
- The (10^n)-th composite number.A065857
The (10^n)-th composite number.
- m-th composite number c(m) = A002808(m), where m is the n-th prime number: a(n) = A002808(A000040(n)).A065858
m-th composite number c(m) = A002808(m), where m is the n-th prime number: a(n) = A002808(A000040(n)).
- Remainder when the n-th prime is divided by the n-th composite number.A065859
Remainder when the n-th prime is divided by the n-th composite number.
- Remainder when the n-th composite number is divided by n.A065860
Remainder when the n-th composite number is divided by n.