Sequences
392,541 sequences
- Numbers k such that prime(k)^2 + k is prime.A064361
Numbers k such that prime(k)^2 + k is prime.
- Numbers k such that no Lucas number is a multiple of k.A064362
Numbers k such that no Lucas number is a multiple of k.
- Number of 2 X 2 regular integer matrices with elements from {0,...,n} up to row and column permutation.A064363
Number of 2 X 2 regular integer matrices with elements from {0,...,n} up to row and column permutation.
- Positive integers sorted by A001414(n), the sum of their prime divisors, as the major key and n as the minor key.A064364
Positive integers sorted by A001414(n), the sum of their prime divisors, as the major key and n as the minor key.
- a(0) = 0; thereafter a(n) = a(n-1)-prime(n) if positive and new, otherwise a(n) = a(n-1)+prime(n), where prime(n) is the n-th prime.A064365
a(0) = 0; thereafter a(n) = a(n-1)-prime(n) if positive and new, otherwise a(n) = a(n-1)+prime(n), where prime(n) is the n-th prime.
- a(n) = binomial(sigma(n), phi(n)).A064366
a(n) = binomial(sigma(n), phi(n)).
- a(n) = 2^n mod prime(n).A064367
a(n) = 2^n mod prime(n).
- Number of 2 X 2 symmetric singular matrices with entries from {0,...,n}.A064368
Number of 2 X 2 symmetric singular matrices with entries from {0,...,n}.
- Smallest integer in Recamán's sequence (A005132) to appear n times.A064369
Smallest integer in Recamán's sequence (A005132) to appear n times.
- Zero, together with positive numbers k such that prime(k) - k is a square.A064370
Zero, together with positive numbers k such that prime(k) - k is a square.
- Zero, together with positive numbers k such that prime(k) + k is a square.A064371
Zero, together with positive numbers k such that prime(k) + k is a square.
- Additive function a(n) defined by the recursive formula a(1)=1 and a(p^k)=a(k) for any prime p.A064372
Additive function a(n) defined by the recursive formula a(1)=1 and a(p^k)=a(k) for any prime p.
- "60-60-842", a popular song by the B52's.A064373
"60-60-842", a popular song by the B52's.
- Numbers k such that sigma(k) > phi(k)^2.A064374
Numbers k such that sigma(k) > phi(k)^2.
- Numbers n such that sigma_2(n) > phi(n)^3.A064375
Numbers n such that sigma_2(n) > phi(n)^3.
- Numbers n such that sigma_3(n) > phi(n)^4.A064376
Numbers n such that sigma_3(n) > phi(n)^4.
- Numbers n such that sigma_4(n) > phi(n)^5.A064377
Numbers n such that sigma_4(n) > phi(n)^5.
- a(0) = 2, a(n) = 2^(n+1)*(n-1)! (n >= 1).A064378
a(0) = 2, a(n) = 2^(n+1)*(n-1)! (n >= 1).
- Irregular triangle whose n-th row is a list of numbers that are infinitarily relatively prime to n (n = 2, 3, ...).A064379
Irregular triangle whose n-th row is a list of numbers that are infinitarily relatively prime to n (n = 2, 3, ...).
- Number of numbers less than n that are infinitarily relatively prime to n; the infinitary Euler phi function.A064380
Number of numbers less than n that are infinitarily relatively prime to n; the infinitary Euler phi function.
- Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).A064381
Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).
- Number of ways to put numbers 1, 2, ..., n*(n+1)/2 in a triangular array of n rows in such a way that each row is increasing or decreasing.A064382
Number of ways to put numbers 1, 2, ..., n*(n+1)/2 in a triangular array of n rows in such a way that each row is increasing or decreasing.
- Integers n >= 1 such that n divides 0!-1!+2!-3!+4!-...+(-1)^{n-1}(n-1)!.A064383
Integers n >= 1 such that n divides 0!-1!+2!-3!+4!-...+(-1)^{n-1}(n-1)!.
- Primes p such that p divides 0!-1!+2!-3!+...+(-1)^{p-1}(p-1)!.A064384
Primes p such that p divides 0!-1!+2!-3!+...+(-1)^{p-1}(p-1)!.
- a(n) = 2*5^n - 3.A064385
a(n) = 2*5^n - 3.
- Numbers of the form 2^k+1 or 4^k-2^k+1.A064386
Numbers of the form 2^k+1 or 4^k-2^k+1.
- Variation (2) on Recamán's sequence (A005132): to get a(n), we first try to subtract n from a(n-1): a(n) = a(n-1)-n if positive and not already in the sequence; if not then a(n) = a(n-1)+n+i, where i >= 0 is the smallest number such that a(n-1)+n+i has not already appeared.A064387
Variation (2) on Recamán's sequence (A005132): to get a(n), we first try to subtract n from a(n-1): a(n) = a(n-1)-n if positive and not already in the sequence; if not then a(n) = a(n-1)+n+i, where i >= 0 is the smallest number such that a(n-1)+n+i has not already appeared.
- Variation (3) on Recamán's sequence (A005132): set s (the step size) initially equal to 2; to get a(n), we first try to subtract s from a(n-1): a(n) = a(n-1)-s if positive and not already in the sequence, in which case we change s to s+1; if not, a(n) = a(n-1)+s+i, where i >= 0 is the smallest number such that a(n-1)+s+i has not already appeared and now we change s to s+i+1.A064388
Variation (3) on Recamán's sequence (A005132): set s (the step size) initially equal to 2; to get a(n), we first try to subtract s from a(n-1): a(n) = a(n-1)-s if positive and not already in the sequence, in which case we change s to s+1; if not, a(n) = a(n-1)+s+i, where i >= 0 is the smallest number such that a(n-1)+s+i has not already appeared and now we change s to s+i+1.
- Variation (4) on Recamán's sequence (A005132): to get a(n), we first try to subtract n from a(n-1): a(n) = a(n-1) - n if positive and not already in the sequence; if not then we try to add n: a(n) = a(n-1) + n if not already in the sequence; if this fails we try to subtract n+1 from a(n-1), or to add n+1 to a(n-1), or to subtract n+2, or to add n+2, etc., until one of these produces a positive number not already in the sequence - this is a(n).A064389
Variation (4) on Recamán's sequence (A005132): to get a(n), we first try to subtract n from a(n-1): a(n) = a(n-1) - n if positive and not already in the sequence; if not then we try to add n: a(n) = a(n-1) + n if not already in the sequence; if this fails we try to subtract n+1 from a(n-1), or to add n+1 to a(n-1), or to subtract n+2, or to add n+2, etc., until one of these produces a positive number not already in the sequence - this is a(n).
- Numbers of the form 2^k*(2^n+1) or 2^k*(4^n-2^n+1).A064390
Numbers of the form 2^k*(2^n+1) or 2^k*(4^n-2^n+1).
- Triangle T(n,k) with zeroth row {1} and row n for n >= 1 giving number of partitions of n with crank k, for -n <= k <= n.A064391
Triangle T(n,k) with zeroth row {1} and row n for n >= 1 giving number of partitions of n with crank k, for -n <= k <= n.
- Numbers in A064383 that are squarefree.A064392
Numbers in A064383 that are squarefree.
- Numbers k such that the exponent of highest power of 2 dividing k! equals the largest prime <= k.A064393
Numbers k such that the exponent of highest power of 2 dividing k! equals the largest prime <= k.
- Numbers k such that the exponent of highest power of 2 dividing k! equals the largest prime < k.A064394
Numbers k such that the exponent of highest power of 2 dividing k! equals the largest prime < k.
- Primes p for which the exponent of the highest power of 2 dividing p! is equal to prevprime(p).A064395
Primes p for which the exponent of the highest power of 2 dividing p! is equal to prevprime(p).
- Primes p for which the exponent of the highest power of 2 dividing p! is equal to prevprime(prevprime(p)).A064396
Primes p for which the exponent of the highest power of 2 dividing p! is equal to prevprime(prevprime(p)).
- Numbers k such that prime(k) + prime(k+1) is a square.A064397
Numbers k such that prime(k) + prime(k+1) is a square.
- Numbers n such that p(n) + p(n+1) is a square and n is prime.A064398
Numbers n such that p(n) + p(n+1) is a square and n is prime.
- Numbers k whose sum of digits exceeds the sum of the digits of k^2.A064399
Numbers k whose sum of digits exceeds the sum of the digits of k^2.
- Number of ordered pairs a,b of elements in the dihedral group D_2n such that the subgroup generated by the pair a,b is the entire group D_2n.A064400
Number of ordered pairs a,b of elements in the dihedral group D_2n such that the subgroup generated by the pair a,b is the entire group D_2n.
- Numbers k such that k! - prime(k) is prime.A064401
Numbers k such that k! - prime(k) is prime.
- Numbers n such that prime(n)+n is a prime, where prime(n) denotes the n-th prime number.A064402
Numbers n such that prime(n)+n is a prime, where prime(n) denotes the n-th prime number.
- Numbers k such that prime(k) + k and prime(k) - k are both primes.A064403
Numbers k such that prime(k) + k and prime(k) - k are both primes.
- When the numerator - denominator (A064169) in n-th harmonic number is prime.A064404
When the numerator - denominator (A064169) in n-th harmonic number is prime.
- Number of even entries (A048967) minus the number of odd entries (A001316) in row n of Pascal's triangle (A007318).A064405
Number of even entries (A048967) minus the number of odd entries (A001316) in row n of Pascal's triangle (A007318).
- Partial sums of A064405.A064406
Partial sums of A064405.
- Even numbers not the sum of a pair of the lesser of the twin primes.A064407
Even numbers not the sum of a pair of the lesser of the twin primes.
- Even numbers not the sum of a pair of the greater of the twin primes.A064408
Even numbers not the sum of a pair of the greater of the twin primes.
- Positive even numbers not of the form A001359(i) + A006512(j) for integers i and j.A064409
Positive even numbers not of the form A001359(i) + A006512(j) for integers i and j.
- Number of partitions of n with zero crank.A064410
Number of partitions of n with zero crank.