Sequences
392,541 sequences
- Composite-then-prime recurrence; a(2n) = a(2n-1)-th composite and a(2n+1) = a(2n)-th prime and a(1) = 1.A064961
Composite-then-prime recurrence; a(2n) = a(2n-1)-th composite and a(2n+1) = a(2n)-th prime and a(1) = 1.
- Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.A064962
Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.
- 10000n+1, 10000n+3, 10000n+7, 10000n+9 are all primes.A064963
10000n+1, 10000n+3, 10000n+7, 10000n+9 are all primes.
- 100000n+1, 100000n+3, 100000n+7, 100000n+9 are all primes.A064964
100000n+1, 100000n+3, 100000n+7, 100000n+9 are all primes.
- 1000000n+1, 1000000n+3, 1000000n+7, 1000000n+9 are all primes.A064965
1000000n+1, 1000000n+3, 1000000n+7, 1000000n+9 are all primes.
- Numbers n such that 10000000n+1, 10000000n+3, 10000000n+7, 10000000n+9 are all primes.A064966
Numbers n such that 10000000n+1, 10000000n+3, 10000000n+7, 10000000n+9 are all primes.
- 100000000n+1, 100000000n+3, 100000000n+7, 100000000n+9 are all primes.A064967
100000000n+1, 100000000n+3, 100000000n+7, 100000000n+9 are all primes.
- Numbers k such that 1000000000k+1, 1000000000k+3, 1000000000k+7, 1000000000k+9 are all primes.A064968
Numbers k such that 1000000000k+1, 1000000000k+3, 1000000000k+7, 1000000000k+9 are all primes.
- Number of cyclic subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).A064969
Number of cyclic subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).
- a(1)=1; thereafter, values of n for which r(n)-r(n-1) and r(n-1)-r(n-2) have the same sign, where r(n) = A005132(n).A064970
a(1)=1; thereafter, values of n for which r(n)-r(n-1) and r(n-1)-r(n-2) have the same sign, where r(n) = A005132(n).
- a(n) = n*usigma(n), where usigma(n) is the sum of unitary divisors of n (A034448).A064971
a(n) = n*usigma(n), where usigma(n) is the sum of unitary divisors of n (A034448).
- Duplicate of A064432.A064972
Duplicate of A064432.
- Values for which A065358 is larger than any preceding term.A064973
Values for which A065358 is larger than any preceding term.
- Numbers k such that k-1, k-3, k-7 and k-9 are all prime.A064974
Numbers k such that k-1, k-3, k-7 and k-9 are all prime.
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.A064975
Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.A064976
n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.
- n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.A064977
n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.
- n*10^4-1, n*10^4-3, n*10^4-7 and n*10^4-9 are all prime.A064978
n*10^4-1, n*10^4-3, n*10^4-7 and n*10^4-9 are all prime.
- n*10^5-1, n*10^5-3, n*10^5-7 and n*10^5-9 are all prime.A064979
n*10^5-1, n*10^5-3, n*10^5-7 and n*10^5-9 are all prime.
- n*10^6-1, n*10^6-3, n*10^6-7 and n*10^6-9 are all prime.A064980
n*10^6-1, n*10^6-3, n*10^6-7 and n*10^6-9 are all prime.
- Numbers k such that k*10^10-1, k*10^10-3, k*10^10-7 and k*10^10-9 are all prime.A064981
Numbers k such that k*10^10-1, k*10^10-3, k*10^10-7 and k*10^10-9 are all prime.
- n*10^7-1, n*10^7-3, n*10^7-7 and n*10^7-9 are all prime.A064982
n*10^7-1, n*10^7-3, n*10^7-7 and n*10^7-9 are all prime.
- a(n) is the smallest prime p such that p*n! - 1 is prime.A064983
a(n) is the smallest prime p such that p*n! - 1 is prime.
- Triangle of coefficients T[n,m] of polynomials n, n^2, (n+2n^3)/3, n^2(2+n^2)/3, n(3+10n^2+2n^4)/15, etc. after multiplication by the denominators (A049606).A064984
Triangle of coefficients T[n,m] of polynomials n, n^2, (n+2n^3)/3, n^2(2+n^2)/3, n(3+10n^2+2n^4)/15, etc. after multiplication by the denominators (A049606).
- Number of partitions of n into factorial parts ( 0! allowed ).A064985
Number of partitions of n into factorial parts ( 0! allowed ).
- Number of partitions of n into factorial parts (0! not allowed).A064986
Number of partitions of n into factorial parts (0! not allowed).
- a(n) = n*sigma(n).A064987
a(n) = n*sigma(n).
- Multiplicative with a(p^e) = prime(p)^e.A064988
Multiplicative with a(p^e) = prime(p)^e.
- Multiplicative with a(2^e) = 1 and a(p^e) = prevprime(p)^e for odd primes p.A064989
Multiplicative with a(2^e) = 1 and a(p^e) = prevprime(p)^e for odd primes p.
- If A_k denotes the first 3^k terms, then A_0 = 0, A_{k+1} = A_k A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.A064990
If A_k denotes the first 3^k terms, then A_0 = 0, A_{k+1} = A_k A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.
- In A064990, drop leading 0's from A_k (for k>0) and convert to decimal.A064991
In A064990, drop leading 0's from A_k (for k>0) and convert to decimal.
- a(n) = usigma(n+1) - usigma(n), where usigma(n) is the sum of unitary divisors of n (A034448).A064992
a(n) = usigma(n+1) - usigma(n), where usigma(n) is the sum of unitary divisors of n (A034448).
- Values for which A065358 is smaller than any preceding term.A064993
Values for which A065358 is smaller than any preceding term.
- A Beatty sequence from Khinchin's constant (A002210).A064994
A Beatty sequence from Khinchin's constant (A002210).
- A Beatty sequence from Khintchin's constant (A002210).A064995
A Beatty sequence from Khintchin's constant (A002210).
- A Beatty sequence: a(n) = floor(Pi^2 - 8).A064996
A Beatty sequence: a(n) = floor(Pi^2 - 8).
- A Beatty sequence: [Pi^2 -8].A064997
A Beatty sequence: [Pi^2 -8].
- a(n) is the smallest prime p such that p*n! +- 1 are twin primes.A064998
a(n) is the smallest prime p such that p*n! +- 1 are twin primes.
- Partial sums of sequence (essentially A002378): 1, 2, 6, 12, 20, 30, 42, 56, 72, 90, ...A064999
Partial sums of sequence (essentially A002378): 1, 2, 6, 12, 20, 30, 42, 56, 72, 90, ...
- Numbers k such that Sum_{i=1..k} mu(sigma(i)) = 0.A065000
Numbers k such that Sum_{i=1..k} mu(sigma(i)) = 0.
- a(n) = (presumed) number of palindromes in the 'Reverse and Add!' trajectory of n, or -1 if this number is not finite.A065001
a(n) = (presumed) number of palindromes in the 'Reverse and Add!' trajectory of n, or -1 if this number is not finite.
- Integers m such that A064992(m) = A064992(m+1).A065002
Integers m such that A064992(m) = A064992(m+1).
- Not McNugget numbers.A065003
Not McNugget numbers.
- 100 written in base n, or -1 if the representation requires digits outside of 0 to 9.A065004
100 written in base n, or -1 if the representation requires digits outside of 0 to 9.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 2.A065005
Integers for which the periodic part of the continued fraction for the square root of n begins with 2.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 3.A065006
Integers for which the periodic part of the continued fraction for the square root of n begins with 3.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 4.A065007
Integers for which the periodic part of the continued fraction for the square root of n begins with 4.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 5.A065008
Integers for which the periodic part of the continued fraction for the square root of n begins with 5.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 6.A065009
Integers for which the periodic part of the continued fraction for the square root of n begins with 6.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 7.A065010
Integers for which the periodic part of the continued fraction for the square root of n begins with 7.