Sequences
392,541 sequences
- Primes which occur exactly twice in the sequence of a(n) = prime(n) - prime(n - pi(n)) = A065308(n).A065311
Primes which occur exactly twice in the sequence of a(n) = prime(n) - prime(n - pi(n)) = A065308(n).
- Primes which occur exactly once in A065308 (prime(n - pi(n))).A065312
Primes which occur exactly once in A065308 (prime(n - pi(n))).
- a(n) = pi(n*pi(n)).A065313
a(n) = pi(n*pi(n)).
- Smallest prime divisor of (n-th primorial - (n+1)-st prime).A065314
Smallest prime divisor of (n-th primorial - (n+1)-st prime).
- Smallest prime divisor of n-th primorial + (n+1)-st prime.A065315
Smallest prime divisor of n-th primorial + (n+1)-st prime.
- Largest prime divisor of n-th primorial - (n+1)-st prime.A065316
Largest prime divisor of n-th primorial - (n+1)-st prime.
- Largest prime divisor of the sum of the n-th primorial and the (n+1)-st prime.A065317
Largest prime divisor of the sum of the n-th primorial and the (n+1)-st prime.
- 24 'Reverse and Add' steps are needed to reach a palindrome.A065318
24 'Reverse and Add' steps are needed to reach a palindrome.
- 30 'Reverse and Add' steps are needed to reach a palindrome.A065319
30 'Reverse and Add' steps are needed to reach a palindrome.
- 53 'Reverse and Add' steps are needed to reach a palindrome.A065320
53 'Reverse and Add' steps are needed to reach a palindrome.
- Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.A065321
Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.
- 55 'Reverse and Add' steps are needed to reach a palindrome.A065322
55 'Reverse and Add' steps are needed to reach a palindrome.
- 58 'Reverse and Add' steps are needed to reach a palindrome.A065323
58 'Reverse and Add' steps are needed to reach a palindrome.
- 64 'Reverse and Add' steps are needed to reach a palindrome.A065324
64 'Reverse and Add' steps are needed to reach a palindrome.
- 78 'Reverse and Add' steps are needed to reach a palindrome.A065325
78 'Reverse and Add' steps are needed to reach a palindrome.
- Numbers such that 79 'Reverse and Add' steps are needed to reach a palindrome.A065326
Numbers such that 79 'Reverse and Add' steps are needed to reach a palindrome.
- 80 'Reverse and Add' steps are needed to reach a palindrome.A065327
80 'Reverse and Add' steps are needed to reach a palindrome.
- a(n) is the number of primes less than or equal to prime(n) - n.A065328
a(n) is the number of primes less than or equal to prime(n) - n.
- Square array read by antidiagonals giving number of binary trees of height n with k points on the n-th level (n,k>0).A065329
Square array read by antidiagonals giving number of binary trees of height n with k points on the n-th level (n,k>0).
- a(n) = max { k | gcd(n, k) = k and gcd(k, 6) = 1 }.A065330
a(n) = max { k | gcd(n, k) = k and gcd(k, 6) = 1 }.
- Largest 3-smooth divisor of n.A065331
Largest 3-smooth divisor of n.
- 3-smooth numbers in their natural position, gaps filled with 0.A065332
3-smooth numbers in their natural position, gaps filled with 0.
- Characteristic function of 3-smooth numbers, i.e., numbers of the form 2^i*3^j (i, j >= 0).A065333
Characteristic function of 3-smooth numbers, i.e., numbers of the form 2^i*3^j (i, j >= 0).
- 2-exponents to represent 3-smooth numbers (A065332).A065334
2-exponents to represent 3-smooth numbers (A065332).
- 3-exponents to represent 3-smooth numbers (A065332).A065335
3-exponents to represent 3-smooth numbers (A065332).
- a(0) = 1; thereafter, a(n) is the smallest number such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.A065336
a(0) = 1; thereafter, a(n) is the smallest number such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.
- a(n) is the smallest number not already used such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.A065337
a(n) is the smallest number not already used such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.
- a(1) = 1, a(p) = p mod 4 for p prime and a(u * v) = a(u) * a(v) for u, v > 0.A065338
a(1) = 1, a(p) = p mod 4 for p prime and a(u * v) = a(u) * a(v) for u, v > 0.
- Number of primes congruent to 3 modulo 4 dividing n (with multiplicity).A065339
Number of primes congruent to 3 modulo 4 dividing n (with multiplicity).
- Third diagonal of triangle in A046740.A065340
Third diagonal of triangle in A046740.
- Mersenne composites: 2^prime(m) - 1 is not a prime.A065341
Mersenne composites: 2^prime(m) - 1 is not a prime.
- Triangle of sum of two primes: prime(n)+prime(k) with n >= k >= 1.A065342
Triangle of sum of two primes: prime(n)+prime(k) with n >= k >= 1.
- Smallest k such that usigma(n+k) = usigma(k).A065343
Smallest k such that usigma(n+k) = usigma(k).
- a(n) = binomial(2*n,n) mod ((n+1)*(n+2)).A065344
a(n) = binomial(2*n,n) mod ((n+1)*(n+2)).
- a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).A065345
a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).
- a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).A065346
a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).
- Positions of zeros in A065344, i.e., binomial(2n,n) mod ((n+1)*(n+2)) = 0.A065347
Positions of zeros in A065344, i.e., binomial(2n,n) mod ((n+1)*(n+2)) = 0.
- Positions of zeros in A065345.A065348
Positions of zeros in A065345.
- Positions of zeros in A065346.A065349
Positions of zeros in A065346.
- a(n) = binomial(2*n, n) mod (n+1)^2.A065350
a(n) = binomial(2*n, n) mod (n+1)^2.
- Duplicate of A002503.A065351
Duplicate of A002503.
- Smallest m such that C(2m,m) is divisible by (m+n)!/m!.A065352
Smallest m such that C(2m,m) is divisible by (m+n)!/m!.
- Decimal representation of palindromes extracted from the Golden String using ever increasing Fibonacci-style subdivisions.A065353
Decimal representation of palindromes extracted from the Golden String using ever increasing Fibonacci-style subdivisions.
- Decimal representation of binary palindromes extracted from the Golden String using ever-increasing Lucas-style subdivisions.A065354
Decimal representation of binary palindromes extracted from the Golden String using ever-increasing Lucas-style subdivisions.
- a(n) = n! - Sum_{k=0..n-1} k!.A065355
a(n) = n! - Sum_{k=0..n-1} k!.
- Final digits of A065355(n) (in reverse order) for sufficiently large n.A065356
Final digits of A065355(n) (in reverse order) for sufficiently large n.
- a(n) = (-1)^pi(n) where pi(n) is the number of primes <= n.A065357
a(n) = (-1)^pi(n) where pi(n) is the number of primes <= n.
- The Jacob's Ladder sequence: a(n) = Sum_{k=1..n} (-1)^pi(k), where pi = A000720.A065358
The Jacob's Ladder sequence: a(n) = Sum_{k=1..n} (-1)^pi(k), where pi = A000720.
- Alternating bit sum for n: replace 2^k with (-1)^k in binary expansion of n.A065359
Alternating bit sum for n: replace 2^k with (-1)^k in binary expansion of n.
- Alternating sum of "negabits". Replace (-2)^k with (-1)^k in negabinary expansion of n.A065360
Alternating sum of "negabits". Replace (-2)^k with (-1)^k in negabinary expansion of n.