Sequences
392,541 sequences
- Array A(n, k) = lunar sum n + k (n >= 0, k >= 0) read by antidiagonals.A087061
Array A(n, k) = lunar sum n + k (n >= 0, k >= 0) read by antidiagonals.
- Array T(n,k) = lunar product n*k (n >= 1, k >= 1) read by antidiagonals.A087062
Array T(n,k) = lunar product n*k (n >= 1, k >= 1) read by antidiagonals.
- Sum{Floor(n*(r^k)): r=sqrt(2)-1, k>=0}.A087063
Sum{Floor(n*(r^k)): r=sqrt(2)-1, k>=0}.
- Sum{Floor(n*r^k): r=1/sqrt(2), k>=0}.A087064
Sum{Floor(n*r^k): r=1/sqrt(2), k>=0}.
- Sum{Floor(n*r^k): r=sqrt(3)-1, k>=0}.A087065
Sum{Floor(n*r^k): r=sqrt(3)-1, k>=0}.
- a(n) = Sum_{k>=0} floor(n*(r^k)), where r = sqrt(5)-2.A087066
a(n) = Sum_{k>=0} floor(n*(r^k)), where r = sqrt(5)-2.
- Incorrect version of A004128.A087067
Incorrect version of A004128.
- Sum{Floor(n*r^k): r=2/3, k>=0}.A087068
Sum{Floor(n*r^k): r=2/3, k>=0}.
- a(n) = Sum_{k >= 0} floor(n/(4^k)).A087069
a(n) = Sum_{k >= 0} floor(n/(4^k)).
- Sum{Floor(n*r^k): r=3/4, k>=0}.A087070
Sum{Floor(n*r^k): r=3/4, k>=0}.
- Number of distinct prime 4-component links with crossing number n.A087071
Number of distinct prime 4-component links with crossing number n.
- Numbers having no partitions into a sum of two or more consecutive primes.A087072
Numbers having no partitions into a sum of two or more consecutive primes.
- Mobius transform of A051664, the number of nonzero terms in the n-th cyclotomic polynomial.A087073
Mobius transform of A051664, the number of nonzero terms in the n-th cyclotomic polynomial.
- For n > 0, 0 <= k <= n^2, T(n,k) is the number of rotationally and reflectively distinct n X n arrays that contain the numbers 1 through k once each and n^2-k zeros.A087074
For n > 0, 0 <= k <= n^2, T(n,k) is the number of rotationally and reflectively distinct n X n arrays that contain the numbers 1 through k once each and n^2-k zeros.
- Multiples of 7 with digits grouped in pairs and leading zeros omitted.A087075
Multiples of 7 with digits grouped in pairs and leading zeros omitted.
- Sums of the squares of the elements in the subsets of the integers 1 to n.A087076
Sums of the squares of the elements in the subsets of the integers 1 to n.
- Total number of elements in all primitive subsets of the integers 1 to n.A087077
Total number of elements in all primitive subsets of the integers 1 to n.
- Sum of the elements in the primitive subsets of the integers 1 to n.A087078
Sum of the elements in the primitive subsets of the integers 1 to n.
- Number of lunar partitions of n: number of ways of writing n as a lunar sum of distinct terms, ignoring order.A087079
Number of lunar partitions of n: number of ways of writing n as a lunar sum of distinct terms, ignoring order.
- Number of elements in the coprime subsets of the integers 1 to n.A087080
Number of elements in the coprime subsets of the integers 1 to n.
- Sum of the elements in the coprime subsets of the integers 1 to n.A087081
Sum of the elements in the coprime subsets of the integers 1 to n.
- Take bounded lunar divisors of n as defined in A087028, add them using normal addition. See A087121 for their lunar sum.A087082
Take bounded lunar divisors of n as defined in A087028, add them using normal addition. See A087121 for their lunar sum.
- Take unbounded lunar divisors of n as defined in A087029, add them using normal addition. See A087416 for their lunar sum.A087083
Take unbounded lunar divisors of n as defined in A087029, add them using normal addition. See A087416 for their lunar sum.
- Number of integer elements in the subsets of the subsets of the integers 1 to n.A087084
Number of integer elements in the subsets of the subsets of the integers 1 to n.
- Sum of the integer elements in the subsets of the subsets of the integers 1 to n.A087085
Sum of the integer elements in the subsets of the subsets of the integers 1 to n.
- Primitive sets of integers, each subset mapped onto a unique binary integer, values here shown in decimal.A087086
Primitive sets of integers, each subset mapped onto a unique binary integer, values here shown in decimal.
- Coprime sets of integers, each subset mapped onto a unique binary integer, values here shown in decimal.A087087
Coprime sets of integers, each subset mapped onto a unique binary integer, values here shown in decimal.
- Positive ruler-type fractal sequence with 1's in every third position.A087088
Positive ruler-type fractal sequence with 1's in every third position.
- Periods of logistic map intervals in order of size.A087089
Periods of logistic map intervals in order of size.
- Positive numbers n such that p=n^2+n+41 and p+2 are twin primes.A087090
Positive numbers n such that p=n^2+n+41 and p+2 are twin primes.
- Numbers k such that p = k^2 + k + 41 and p - 2 are twin primes.A087091
Numbers k such that p = k^2 + k + 41 and p - 2 are twin primes.
- Descending squares: which squares can be packed with at least 2 squares so that every square directly above a square is strictly smaller? It is conjectured that the answer is all except those in this sequence.A087092
Descending squares: which squares can be packed with at least 2 squares so that every square directly above a square is strictly smaller? It is conjectured that the answer is all except those in this sequence.
- Numbers that have the same number of divisors as their digit reversal, but with different prime signatures.A087093
Numbers that have the same number of divisors as their digit reversal, but with different prime signatures.
- a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.A087094
a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.
- a(n) = A077503(n) - n*10^d, where d = n-A055642(n), A055642(n) = number of digits in n.A087095
a(n) = A077503(n) - n*10^d, where d = n-A055642(n), A055642(n) = number of digits in n.
- Duplicate of A072959.A087096
Duplicate of A072959.
- Lunar primes (formerly called dismal primes) (cf. A087062).A087097
Lunar primes (formerly called dismal primes) (cf. A087062).
- Partial sums of A087100.A087098
Partial sums of A087100.
- Partial sums of A063914.A087099
Partial sums of A063914.
- A000225 (2^n - 1) interlaced with A008593 (11n).A087100
A000225 (2^n - 1) interlaced with A008593 (11n).
- Number of symmetric quartic graphs on n nodes.A087101
Number of symmetric quartic graphs on n nodes.
- Number of numbers occurring most frequently as difference between consecutive primes <= prime(n).A087102
Number of numbers occurring most frequently as difference between consecutive primes <= prime(n).
- Smallest jumping champion for prime(n).A087103
Smallest jumping champion for prime(n).
- Greatest jumping champion for prime(n).A087104
Greatest jumping champion for prime(n).
- (prime(n-1) + 1)*(prime(n+1) - 1).A087105
(prime(n-1) + 1)*(prime(n+1) - 1).
- Primes of the form (prime(k-1)+1)*(prime(k+1)-1) + 1, k>1.A087106
Primes of the form (prime(k-1)+1)*(prime(k+1)-1) + 1, k>1.
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of tetrahedral numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 3*p-2, where a(i,p) satisfies Sum_{i=1..n} C(i+2,3)^p = 4 * C(n+3,4) * Sum_{i=1..3*p-2} a(i,p) * C(n-1,i-1)/(i+3).A087107
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of tetrahedral numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 3*p-2, where a(i,p) satisfies Sum_{i=1..n} C(i+2,3)^p = 4 * C(n+3,4) * Sum_{i=1..3*p-2} a(i,p) * C(n-1,i-1)/(i+3).
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,4). The p-th row (p>=1) contains a(i,p) for i=1 to 4*p-3, where a(i,p) satisfies Sum_{i=1..n} C(i+3,4)^p = 5 * C(n+4,5) * Sum_{i=1..4*p-3} a(i,p) * C(n-1,i-1)/(i+4).A087108
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,4). The p-th row (p>=1) contains a(i,p) for i=1 to 4*p-3, where a(i,p) satisfies Sum_{i=1..n} C(i+3,4)^p = 5 * C(n+4,5) * Sum_{i=1..4*p-3} a(i,p) * C(n-1,i-1)/(i+4).
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).A087109
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6*p-5, where a(i,p) satisfies Sum_{i=1..n} C(i+5,6)^p = 7 * C(n+6,7) * Sum_{i=1..6*p-5} a(i,p) * C(n-1,i-1)/(i+6).A087110
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6*p-5, where a(i,p) satisfies Sum_{i=1..n} C(i+5,6)^p = 7 * C(n+6,7) * Sum_{i=1..6*p-5} a(i,p) * C(n-1,i-1)/(i+6).