Sequences
392,541 sequences
- First row of Pascal's triangle that has n distinct nonsquarefree entries, or -1 if no such row exists.A064461
First row of Pascal's triangle that has n distinct nonsquarefree entries, or -1 if no such row exists.
- First row of Pascal's triangle that has n nonsquarefree entries, or -1 if no such row exists.A064462
First row of Pascal's triangle that has n nonsquarefree entries, or -1 if no such row exists.
- Numbers k such that A001414(k) is a square and sets a new record for squares.A064463
Numbers k such that A001414(k) is a square and sets a new record for squares.
- Binary order (cf. A029837) of the number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n (cf. A060692).A064464
Binary order (cf. A029837) of the number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n (cf. A060692).
- Numbers k such that A048138(k) = A034444(k).A064465
Numbers k such that A048138(k) = A034444(k).
- a(0) = 6 and a(n) = Min { m > a(n-1) | both a(n-1) - p and m - p are prime for some prime p } for n > 0.A064466
a(0) = 6 and a(n) = Min { m > a(n-1) | both a(n-1) - p and m - p are prime for some prime p } for n > 0.
- Primes in Pi: a(n) = first position in decimal expansion of Pi that matches the n-th prime, or 0 if there is no such position.A064467
Primes in Pi: a(n) = first position in decimal expansion of Pi that matches the n-th prime, or 0 if there is no such position.
- Positions of powers of 2 in A064413 (if it starts at 2).A064468
Positions of powers of 2 in A064413 (if it starts at 2).
- The even subsequence of A064413.A064469
The even subsequence of A064413.
- The even subsequence of A064413, divided by 2.A064470
The even subsequence of A064413, divided by 2.
- The odd subsequence of A064413.A064471
The odd subsequence of A064413.
- Where the even terms appear in A064413 (if it begins with 2).A064472
Where the even terms appear in A064413 (if it begins with 2).
- Where the odd terms appear in A064413 (if it begins at 2).A064473
Where the odd terms appear in A064413 (if it begins at 2).
- Number of even terms among first n terms of A064413.A064474
Number of even terms among first n terms of A064413.
- Number of odd terms among first n terms of A064413 (if it begins at 2).A064475
Number of odd terms among first n terms of A064413 (if it begins at 2).
- For an integer k with prime factorization p_1*p_2*p_3* ... *p_m let k* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1) (A064478); sequence gives k such that k* is divisible by k.A064476
For an integer k with prime factorization p_1*p_2*p_3* ... *p_m let k* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1) (A064478); sequence gives k such that k* is divisible by k.
- A064637 converted to factorial base.A064477
A064637 converted to factorial base.
- If n = Product p(k)^e(k) then a(n) = Product (p(k)+1)^e(k), a(0) = 1, a(1)=2.A064478
If n = Product p(k)^e(k) then a(n) = Product (p(k)+1)^e(k), a(0) = 1, a(1)=2.
- Complement of A064478.A064479
Complement of A064478.
- Form a conjugate partition of row with 1+1+1 in first row. all other rows are the union of their parents. a(n) = number of types of piles in the n-th row.A064480
Form a conjugate partition of row with 1+1+1 in first row. all other rows are the union of their parents. a(n) = number of types of piles in the n-th row.
- Numbers which are divisible by the sum of their base-5 digits.A064481
Numbers which are divisible by the sum of their base-5 digits.
- Triangle read by rows: T(n,k) (n >= 2, 1<=k<=n-1) is the number of permutations p of 1,...,n with max(|p(i)-p(i-1)|, i=2..n) = k.A064482
Triangle read by rows: T(n,k) (n >= 2, 1<=k<=n-1) is the number of permutations p of 1,...,n with max(|p(i)-p(i-1)|, i=2..n) = k.
- Numbers k such that k^2 + prime(k) and k^2 - prime(k) are both primes.A064483
Numbers k such that k^2 + prime(k) and k^2 - prime(k) are both primes.
- Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.A064484
Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.
- 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 a proper subgroup of D_2n.A064485
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 a proper subgroup of D_2n.
- Period of continued fraction for square roots of primorials.A064486
Period of continued fraction for square roots of primorials.
- Order of twisted Suzuki group Sz(2^(2*n + 1)), also known as the group 2B2(2^(2*n + 1)).A064487
Order of twisted Suzuki group Sz(2^(2*n + 1)), also known as the group 2B2(2^(2*n + 1)).
- A Beatty sequence: Floor[n*c], where c = A064648 is the sum of the reciprocals of primorials.A064488
A Beatty sequence: Floor[n*c], where c = A064648 is the sum of the reciprocals of primorials.
- a(n) is the smallest number m such that prime(m) has prime(n) decimal digits.A064489
a(n) is the smallest number m such that prime(m) has prime(n) decimal digits.
- Smallest prime with prime(n) decimal digits.A064490
Smallest prime with prime(n) decimal digits.
- a(1) = 1, a(n+1) = a(n) + tau(a(n)), where tau(n) (A000005) is the number of divisors of n.A064491
a(1) = 1, a(n+1) = a(n) + tau(a(n)), where tau(n) (A000005) is the number of divisors of n.
- Start of n-th segment of Recamán's sequence R(m) (A005132): values of n where the change in the fractional parts of successive values of R(n)/n is positive.A064492
Start of n-th segment of Recamán's sequence R(m) (A005132): values of n where the change in the fractional parts of successive values of R(n)/n is positive.
- List of distinct greatest common divisors of { k! and k! - (k-1)! + (k-2)! - ... + (-1)^k*0!, k = 0 .. n}.A064493
List of distinct greatest common divisors of { k! and k! - (k-1)! + (k-2)! - ... + (-1)^k*0!, k = 0 .. n}.
- Shotgun (or Schrotschuss) numbers: limit of the recursion B(k) =T[k](B(k-1)), where B(1) = (1,2,3,4,5,...) and T[k] is the Transformation that permutes the entries k(2i-1) and k(2i) for all positive integers i.A064494
Shotgun (or Schrotschuss) numbers: limit of the recursion B(k) =T[k](B(k-1)), where B(1) = (1,2,3,4,5,...) and T[k] is the Transformation that permutes the entries k(2i-1) and k(2i) for all positive integers i.
- Prime(n^2) +/- n are primes.A064495
Prime(n^2) +/- n are primes.
- a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12).A064496
a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12).
- a(n) = prime(n) * Fibonacci(n).A064497
a(n) = prime(n) * Fibonacci(n).
- Numbers k such that the sum of unitary divisors of k^2 is a square.A064498
Numbers k such that the sum of unitary divisors of k^2 is a square.
- Composite numbers n such that product of aliquot divisors of n is a perfect square.A064499
Composite numbers n such that product of aliquot divisors of n is a perfect square.
- Smallest number with n decimal digits such that the product of its digits equals n * the sum of its digits, or 0 if impossible.A064500
Smallest number with n decimal digits such that the product of its digits equals n * the sum of its digits, or 0 if impossible.
- Sum of unitary divisors of n^3 is a square.A064501
Sum of unitary divisors of n^3 is a square.
- Smallest m such that sum of distinct primes dividing m equals n, or 0 if no such number exists (as at n=1,4,6).A064502
Smallest m such that sum of distinct primes dividing m equals n, or 0 if no such number exists (as at n=1,4,6).
- Bisection of A064394.A064503
Bisection of A064394.
- Numbers k such that prime(k) + prime(k+1)*2 is a square.A064504
Numbers k such that prime(k) + prime(k+1)*2 is a square.
- Interchange primes and their squares.A064505
Interchange primes and their squares.
- a(n) = Max { k | k*(k+1)/2 <= n*(n+1)/2 - k*(k+1)/2 }.A064506
a(n) = Max { k | k*(k+1)/2 <= n*(n+1)/2 - k*(k+1)/2 }.
- Numbers of more than one digit that yield primes when cast in their own base.A064507
Numbers of more than one digit that yield primes when cast in their own base.
- Prime numbers generated by casting a number in its own base.A064508
Prime numbers generated by casting a number in its own base.
- Marks (in fathoms) on lead line used by ships on the Mississippi River.A064509
Marks (in fathoms) on lead line used by ships on the Mississippi River.
- Numbers m such that the sum of the first k divisors of m is equal to m for some k.A064510
Numbers m such that the sum of the first k divisors of m is equal to m for some k.