Sequences
392,541 sequences
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,7). The p-th row (p>=1) contains a(i,p) for i=1 to 7*p-6, where a(i,p) satisfies Sum_{i=1..n} C(i+6,7)^p = 8 * C(n+7,8) * Sum_{i=1..7*p-6} a(i,p) * C(n-1,i-1)/(i+7).A087111
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,7). The p-th row (p>=1) contains a(i,p) for i=1 to 7*p-6, where a(i,p) satisfies Sum_{i=1..n} C(i+6,7)^p = 8 * C(n+7,8) * Sum_{i=1..7*p-6} a(i,p) * C(n-1,i-1)/(i+7).
- Triangle in which the n-th row contains n distinct semiprimes not listed previously with all prime factors from among the first n primes.A087112
Triangle in which the n-th row contains n distinct semiprimes not listed previously with all prime factors from among the first n primes.
- Essentially a duplicate of A005843.A087113
Essentially a duplicate of A005843.
- Number of regular bipartite simple graphs on n nodes.A087114
Number of regular bipartite simple graphs on n nodes.
- Convolution of sum of cubes of divisors with itself.A087115
Convolution of sum of cubes of divisors with itself.
- Number of maximal groups of consecutive zeros in binary representation of n.A087116
Number of maximal groups of consecutive zeros in binary representation of n.
- Number of zeros in the longest string of consecutive zeros in the binary representation of n.A087117
Number of zeros in the longest string of consecutive zeros in the binary representation of n.
- Numbers having exactly one maximal group of consecutive zeros in binary representation of n.A087118
Numbers having exactly one maximal group of consecutive zeros in binary representation of n.
- Numbers having more than one maximal group of consecutive zeros in binary representation of n.A087119
Numbers having more than one maximal group of consecutive zeros in binary representation of n.
- Smallest numbers having in binary representation exactly n maximal groups of consecutive zeros.A087120
Smallest numbers having in binary representation exactly n maximal groups of consecutive zeros.
- Take bounded lunar divisors of n as defined in A087028, add them using lunar addition. See A087082 for their conventional sum.A087121
Take bounded lunar divisors of n as defined in A087028, add them using lunar addition. See A087082 for their conventional sum.
- a(n) is the number of non-congruent solutions to x^2*y^2 == 0 (mod n).A087122
a(n) is the number of non-congruent solutions to x^2*y^2 == 0 (mod n).
- a(n) = Fibonacci(n+1) - (-1)^n*Fibonacci(n).A087123
a(n) = Fibonacci(n+1) - (-1)^n*Fibonacci(n).
- a(n) = Fibonacci(n) + Fibonacci(2n+1).A087124
a(n) = Fibonacci(n) + Fibonacci(2n+1).
- Indices k of hex numbers H(k) that are also triangular.A087125
Indices k of hex numbers H(k) that are also triangular.
- Primes of the form p^k - p^(k-1) + 1 for some prime p and integer k > 1.A087126
Primes of the form p^k - p^(k-1) + 1 for some prime p and integer k > 1.
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2*p-1, where a(i,p) satisfies Sum_{i=1..n} C(i+1,2)^p = 3 * C(n+2,3) * Sum_{i=1..2*p-1} a(i,p) * C(n-1,i-1)/(i+2).A087127
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2*p-1, where a(i,p) satisfies Sum_{i=1..n} C(i+1,2)^p = 3 * C(n+2,3) * Sum_{i=1..2*p-1} a(i,p) * C(n-1,i-1)/(i+2).
- a(1)=1 and, for n>1, a(n) is the smallest positive integer such that 1+Sum_{k=a(n-1)+1..a(n)} k is prime.A087128
a(1)=1 and, for n>1, a(n) is the smallest positive integer such that 1+Sum_{k=a(n-1)+1..a(n)} k is prime.
- First differences of A087128.A087129
First differences of A087128.
- a(n) = 5*a(n-1)+a(n-2) for n>1, a(0)=2, a(1)=5.A087130
a(n) = 5*a(n-1)+a(n-2) for n>1, a(0)=2, a(1)=5.
- a(n) = 2^n*Lucas(n), where Lucas = A000032.A087131
a(n) = 2^n*Lucas(n), where Lucas = A000032.
- a(n) is the sum of the squares of the sizes of the conjugacy classes in the symmetric group S_n.A087132
a(n) is the sum of the squares of the sizes of the conjugacy classes in the symmetric group S_n.
- Number of divisors of n that are not greater than the greatest prime-factor of n; a(1)=1.A087133
Number of divisors of n that are not greater than the greatest prime-factor of n; a(1)=1.
- Smallest number having exactly n divisors that are not greater than the number's greatest prime factor.A087134
Smallest number having exactly n divisors that are not greater than the number's greatest prime factor.
- Number of positive numbers m such that A073642(m) = n.A087135
Number of positive numbers m such that A073642(m) = n.
- Smallest positive number m such that A073642(m)=n.A087136
Smallest positive number m such that A073642(m)=n.
- a(n) is the number of permutations in the symmetric group S_n that contain an odd cycle.A087137
a(n) is the number of permutations in the symmetric group S_n that contain an odd cycle.
- Expansion of (1-sqrt(1-4*log(1+x)))/2.A087138
Expansion of (1-sqrt(1-4*log(1+x)))/2.
- Least k>1 such that p^k - p^(k-1) + 1 is prime for p = prime(n).A087139
Least k>1 such that p^k - p^(k-1) + 1 is prime for p = prime(n).
- Numbers that are not divisible by all their digits in decimal representation.A087140
Numbers that are not divisible by all their digits in decimal representation.
- Numbers divisible by the sum of their digits, but not by all their individual digits.A087141
Numbers divisible by the sum of their digits, but not by all their individual digits.
- Numbers divisible by their individual digits, but not by the sum of their digits (counted with multiplicity).A087142
Numbers divisible by their individual digits, but not by the sum of their digits (counted with multiplicity).
- Numbers n such that sum of digits of n is divisible by digital root of n.A087143
Numbers n such that sum of digits of n is divisible by digital root of n.
- Numbers with sum of digits not divisible by digital root.A087144
Numbers with sum of digits not divisible by digital root.
- Number of distinct disconnected simple symmetric graphs on n nodes.A087145
Number of distinct disconnected simple symmetric graphs on n nodes.
- Numbers k such that k! + (k+1)! - 1 is prime.A087146
Numbers k such that k! + (k+1)! - 1 is prime.
- Numbers k such that k! + (k+1)! + 1 is prime.A087147
Numbers k such that k! + (k+1)! + 1 is prime.
- Increasing positive integers a(n), a(1)=1, such that the self-convolution results in the smallest multiples of index n: n*A087149(n).A087148
Increasing positive integers a(n), a(1)=1, such that the self-convolution results in the smallest multiples of index n: n*A087149(n).
- Least positive multiples of index n that can result from the self-convolution of a monotonically increasing sequence (A087148).A087149
Least positive multiples of index n that can result from the self-convolution of a monotonically increasing sequence (A087148).
- Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares.A087150
Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares.
- Positive square-root of terms of the self-convolution of A087150.A087151
Positive square-root of terms of the self-convolution of A087150.
- Expansion of (1-sqrt(1-4*log(1+x)))/log(1+x)/2.A087152
Expansion of (1-sqrt(1-4*log(1+x)))/log(1+x)/2.
- Number of partitions of n into nonsquares.A087153
Number of partitions of n into nonsquares.
- Number of partitions of n into distinct nonsquares.A087154
Number of partitions of n into distinct nonsquares.
- Primes having nontrivial palindromic representation in some (at least one) base.A087155
Primes having nontrivial palindromic representation in some (at least one) base.
- Nonnegative numbers excluding 1.A087156
Nonnegative numbers excluding 1.
- Satisfies a(1)=1, a(A087158(n+1)) = a(n)+1, with a(m)=1 for all m not found in A087158, where A087158(n+2)=A087158(n+1)+a(n)+1.A087157
Satisfies a(1)=1, a(A087158(n+1)) = a(n)+1, with a(m)=1 for all m not found in A087158, where A087158(n+2)=A087158(n+1)+a(n)+1.
- Satisfies a(n+2)=a(n+1)+A087157(n)+1.A087158
Satisfies a(n+2)=a(n+1)+A087157(n)+1.
- Satisfies a(1)=1, a(A087160(n+1)) = a(n)+1, with a(m)=2 for all m not found in A087160, where A087160(n+2)=A087160(n+1)+a(n)+1.A087159
Satisfies a(1)=1, a(A087160(n+1)) = a(n)+1, with a(m)=2 for all m not found in A087160, where A087160(n+2)=A087160(n+1)+a(n)+1.
- Satisfies a(1)=1, a(2)=2, a(n+2)=a(n+1)+A087159(n)+1.A087160
Satisfies a(1)=1, a(2)=2, a(n+2)=a(n+1)+A087159(n)+1.