Sequences
392,541 sequences
- Numbers n such that n^2 + prime(n) is a prime.A064711
Numbers n such that n^2 + prime(n) is a prime.
- Numbers k such that k^2 - prime(k) is a prime.A064712
Numbers k such that k^2 - prime(k) is a prime.
- Numbers k such that prime(k)^2 - k is prime.A064713
Numbers k such that prime(k)^2 - k is prime.
- Define q(0)=1, q(1)=1, q(2)=1, q(n)=q(abs(n-q(n-2)))+q(abs(n-q(n-3))) (A063892); then a(0) = 1, a(n)=a(n-1)+2*(q(n)-n/2), n > 0.A064714
Define q(0)=1, q(1)=1, q(2)=1, q(n)=q(abs(n-q(n-2)))+q(abs(n-q(n-3))) (A063892); then a(0) = 1, a(n)=a(n-1)+2*(q(n)-n/2), n > 0.
- Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares.A064715
Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares.
- Smallest member of three consecutive numbers each of which is the sum of two nonzero squares (not necessarily different).A064716
Smallest member of three consecutive numbers each of which is the sum of two nonzero squares (not necessarily different).
- A Beatty sequence for 2^i + 2^(-i) where i = sqrt(-1).A064717
A Beatty sequence for 2^i + 2^(-i) where i = sqrt(-1).
- A Beatty sequence for 2^i + 2^-i where i = sqrt(-1).A064718
A Beatty sequence for 2^i + 2^-i where i = sqrt(-1).
- A Beatty sequence for 3^i + 3^-i + 1.A064719
A Beatty sequence for 3^i + 3^-i + 1.
- A Beatty sequence for 3^i + 3^-i + 1.A064720
A Beatty sequence for 3^i + 3^-i + 1.
- Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921).A064721
Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921).
- a(1) = 0; for n >= 2, a(n) = n - (largest prime <= n).A064722
a(1) = 0; for n >= 2, a(n) = n - (largest prime <= n).
- (L(p)-1)/p where L() are the Lucas numbers (A000032) and p runs through the primes.A064723
(L(p)-1)/p where L() are the Lucas numbers (A000032) and p runs through the primes.
- A Beatty sequence for 2^sqrt(2).A064724
A Beatty sequence for 2^sqrt(2).
- Sum of primes dividing Fibonacci(n) (with repetition).A064725
Sum of primes dividing Fibonacci(n) (with repetition).
- Sum of primes dividing the partitions of n into distinct parts (with repetition).A064726
Sum of primes dividing the partitions of n into distinct parts (with repetition).
- Number of pairs x,y such that 0 < x <= y < n and x+y = n and x*y = k*n for some k.A064727
Number of pairs x,y such that 0 < x <= y < n and x+y = n and x*y = k*n for some k.
- Solutions to A064494(n) = 2(n+1).A064728
Solutions to A064494(n) = 2(n+1).
- Numbers k such that k and k+1 have the same sum of unitary and nonunitary divisors.A064729
Numbers k such that k and k+1 have the same sum of unitary and nonunitary divisors.
- Numbers whose sum of nonunitary divisors and sum of unitary divisors are both positive squares.A064730
Numbers whose sum of nonunitary divisors and sum of unitary divisors are both positive squares.
- Number of connected integral graphs on n vertices.A064731
Number of connected integral graphs on n vertices.
- Number of labeled Hugenholtz diagrams with n nodes.A064732
Number of labeled Hugenholtz diagrams with n nodes.
- Final digits of A005165(2n) for large n, read from right.A064733
Final digits of A005165(2n) for large n, read from right.
- Final digits of A005165(2n+1) for large n, read from right.A064734
Final digits of A005165(2n+1) for large n, read from right.
- Next prime containing prime(n) in decimal notation.A064735
Next prime containing prime(n) in decimal notation.
- a(1)=1, a(2)=2; for n>0, a(2*n+2) = smallest number missing from {a(1), ... ,a(2*n)}, and a(2*n+1) = a(2*n)*a(2*n+2).A064736
a(1)=1, a(2)=2; for n>0, a(2*n+2) = smallest number missing from {a(1), ... ,a(2*n)}, and a(2*n+1) = a(2*n)*a(2*n+2).
- Fibonacci sequence (A000045) mod 10 with carry.A064737
Fibonacci sequence (A000045) mod 10 with carry.
- Numbers k such that k! + Fibonacci(k) is prime.A064738
Numbers k such that k! + Fibonacci(k) is prime.
- Primes p such that Fibonacci(p)-1 is divisible by p.A064739
Primes p such that Fibonacci(p)-1 is divisible by p.
- Smallest controlling prime when A064413(n) is computed.A064740
Smallest controlling prime when A064413(n) is computed.
- Length of A064743(n); Index of the largest prime factor of the n-th term of EKG-sequence.A064741
Length of A064743(n); Index of the largest prime factor of the n-th term of EKG-sequence.
- Total number of primes (with multiplicity) dividing A064413(n).A064742
Total number of primes (with multiplicity) dividing A064413(n).
- A064413(n) written in base of primes, read from right to left, written as a string.A064743
A064413(n) written in base of primes, read from right to left, written as a string.
- A064413(n) written in base of primes, read from right to left, written as n-th row of a table.A064744
A064413(n) written in base of primes, read from right to left, written as n-th row of a table.
- Inverse permutation to A064736.A064745
Inverse permutation to A064736.
- a(n) = n*8^n + 1.A064746
a(n) = n*8^n + 1.
- a(n) = n*9^n + 1.A064747
a(n) = n*9^n + 1.
- a(n) = n*10^n + 1.A064748
a(n) = n*10^n + 1.
- a(n) = n*11^n + 1.A064749
a(n) = n*11^n + 1.
- a(n) = n*12^n + 1.A064750
a(n) = n*12^n + 1.
- a(n) = n*5^n - 1.A064751
a(n) = n*5^n - 1.
- a(n) = n*6^n - 1.A064752
a(n) = n*6^n - 1.
- a(n) = n*7^n - 1.A064753
a(n) = n*7^n - 1.
- a(n) = n*8^n - 1.A064754
a(n) = n*8^n - 1.
- a(n) = n*9^n - 1.A064755
a(n) = n*9^n - 1.
- a(n) = n*10^n - 1.A064756
a(n) = n*10^n - 1.
- a(n) = n*11^n - 1.A064757
a(n) = n*11^n - 1.
- a(n) = n*12^n - 1.A064758
a(n) = n*12^n - 1.
- Numbers k such that k! - Fibonacci(k) is prime.A064759
Numbers k such that k! - Fibonacci(k) is prime.
- Variant of A002034 with initial term 0.A064760
Variant of A002034 with initial term 0.