Sequences
392,541 sequences
- Primes p whose period of reciprocal equals (p-1)/6.A056211
Primes p whose period of reciprocal equals (p-1)/6.
- Primes p whose period of reciprocal equals (p-1)/7.A056212
Primes p whose period of reciprocal equals (p-1)/7.
- Primes p for which the period of reciprocal = (p-1)/8.A056213
Primes p for which the period of reciprocal = (p-1)/8.
- Primes p whose period of reciprocal equals (p-1)/9.A056214
Primes p whose period of reciprocal equals (p-1)/9.
- Primes p whose reciprocal has period (p-1)/10.A056215
Primes p whose reciprocal has period (p-1)/10.
- Primes p whose period of reciprocal equals (p-1)/11.A056216
Primes p whose period of reciprocal equals (p-1)/11.
- Primes p for which the period of reciprocal 1/p is (p-1)/12.A056217
Primes p for which the period of reciprocal 1/p is (p-1)/12.
- If n = p_1^a_1 * p_2^a_2 * p_3^a_3 * ..., where p_k is the k-th prime and the a's are nonnegative integers, then a(n) = n!/product_{k >= 1} [(p_k)!^a_k].A056218
If n = p_1^a_1 * p_2^a_2 * p_3^a_3 * ..., where p_k is the k-th prime and the a's are nonnegative integers, then a(n) = n!/product_{k >= 1} [(p_k)!^a_k].
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.A056219
Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.
- a(n) = 2*n^2 - 1.A056220
a(n) = 2*n^2 - 1.
- Image of primes (A000040) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.A056221
Image of primes (A000040) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.
- Image of partition numbers (A000041) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.A056222
Image of partition numbers (A000041) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.
- Hankel transform of partition numbers (A000041).A056223
Hankel transform of partition numbers (A000041).
- Image of number of divisors sequence (A000005) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.A056224
Image of number of divisors sequence (A000005) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.
- Hankel transform of number of divisors sequence (A000005).A056225
Hankel transform of number of divisors sequence (A000005).
- Image of Moebius function (A008683) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.A056226
Image of Moebius function (A008683) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.
- Hankel transform of Moebius function A008683.A056227
Hankel transform of Moebius function A008683.
- Image of Euler totient function (A000010) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.A056228
Image of Euler totient function (A000010) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.
- Hankel transform of Euler totient function (A000010).A056229
Hankel transform of Euler totient function (A000010).
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives array read by antidiagonals.A056230
Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives array read by antidiagonals.
- Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 1.A056231
Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 1.
- Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 2.A056232
Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 2.
- Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 3.A056233
Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 3.
- Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives numbers not used.A056234
Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives numbers not used.
- n*2^(n*2^n+n)-1.A056235
n*2^(n*2^n+n)-1.
- a(n) = (2 + sqrt(2))^n + (2 - sqrt(2))^n.A056236
a(n) = (2 + sqrt(2))^n + (2 - sqrt(2))^n.
- a(n) = 2*n^2 + 9*n - 5.A056237
a(n) = 2*n^2 + 9*n - 5.
- Nontrivial palindromic denominators in Leibniz's harmonic triangle.A056238
Nontrivial palindromic denominators in Leibniz's harmonic triangle.
- If n = Product_{k >= 1} (p_k)^(c_k) where p_k is k-th prime and c_k >= 0 then a(n) = Sum_{k >= 1} k*c_k.A056239
If n = Product_{k >= 1} (p_k)^(c_k) where p_k is k-th prime and c_k >= 0 then a(n) = Sum_{k >= 1} k*c_k.
- Smallest number whose prime divisors (taken with multiplicity) add to n.A056240
Smallest number whose prime divisors (taken with multiplicity) add to n.
- Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).A056241
Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).
- Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).A056242
Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
- Third diagonal of triangle A056242.A056243
Third diagonal of triangle A056242.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 21 for n > 0.A056244
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 21 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 31 for n > 0.A056245
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 31 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 41 for n > 0.A056246
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 41 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 51 for n > 0.A056247
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 51 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 61 for n > 0.A056248
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 61 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 71 for n > 0.A056249
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 71 for n > 0.
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 81 for n > 0.A056250
Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 81 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) - 17 for n > 0.A056251
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) - 17 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) - 7 for n > 0.A056252
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) - 7 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 13 for n > 0.A056253
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 13 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 23 for n > 0.A056254
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 23 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 43 for n > 0.A056255
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 43 for n > 0.
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 53 for n > 0.A056256
Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 53 for n > 0.
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 43 for n > 0.A056257
Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 43 for n > 0.
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 23 for n > 0.A056258
Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 23 for n > 0.
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 13 for n > 0.A056259
Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 13 for n > 0.
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 3 for n > 0. Numbers n such that (690*10^n + 3)/9 is prime.A056260
Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 3 for n > 0. Numbers n such that (690*10^n + 3)/9 is prime.