Sequences
392,541 sequences
- Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5*a(n+2) - 6* a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.A087161
Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5*a(n+2) - 6* a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.
- Satisfies a(1)=1, a(A087163(n+1)) = a(n)+1, with a(m)=3 for all m not found in A087163, where A087163(n+2)=A087163(n+1)+a(n)+1.A087162
Satisfies a(1)=1, a(A087163(n+1)) = a(n)+1, with a(m)=3 for all m not found in A087163, where A087163(n+2)=A087163(n+1)+a(n)+1.
- Satisfies a(1)=1, a(2)=2, a(n+2)=a(n+1)+A087162(n)+1.A087163
Satisfies a(1)=1, a(2)=2, a(n+2)=a(n+1)+A087162(n)+1.
- Records in A087162: A087162(a(n))=n.A087164
Records in A087162: A087162(a(n))=n.
- a(n)=1 when n == 1 (mod 4), otherwise a(n) = a(n - ceiling(n/4)) + 1. Removing all the 1's results in the original sequence with every term incremented by 1.A087165
a(n)=1 when n == 1 (mod 4), otherwise a(n) = a(n - ceiling(n/4)) + 1. Removing all the 1's results in the original sequence with every term incremented by 1.
- Primes which are palindromes in 3 or more bases.A087166
Primes which are palindromes in 3 or more bases.
- Numbers k such that sigma(k) - 2k = 6.A087167
Numbers k such that sigma(k) - 2k = 6.
- Expansion of (1 + 2*x)/(1 + 3*x + 4*x^2).A087168
Expansion of (1 + 2*x)/(1 + 3*x + 4*x^2).
- Expansion of (1 + 3*x)/(1 + 5*x + 9*x^2).A087169
Expansion of (1 + 3*x)/(1 + 5*x + 9*x^2).
- Expansion of (1 + 4*x)/(1 + 7*x + 16*x^2).A087170
Expansion of (1 + 4*x)/(1 + 7*x + 16*x^2).
- Expansion of (1 + 5*x)/(1 + 9*x + 25*x^2).A087171
Expansion of (1 + 5*x)/(1 + 9*x + 25*x^2).
- Greatest Fibonacci number that does not exceed n.A087172
Greatest Fibonacci number that does not exceed n.
- Smallest prime factor of n-th partition number.A087173
Smallest prime factor of n-th partition number.
- Duplicate of A071963.A087174
Duplicate of A071963.
- Number of distinct primes dividing the n-th partition number.A087175
Number of distinct primes dividing the n-th partition number.
- a(n) - 1 is the maximal number of integers for which the absolute value of a reducible polynomial with integral coefficients of degree n is a prime.A087176
a(n) - 1 is the maximal number of integers for which the absolute value of a reducible polynomial with integral coefficients of degree n is a prime.
- Number of even partition numbers <= P(n), where P=A000041.A087177
Number of even partition numbers <= P(n), where P=A000041.
- ((1/2)/p^2)*(T(p)-1) where p runs through the prime >= 5 and T(k) is the k-th central trinomial number (A002426).A087178
((1/2)/p^2)*(T(p)-1) where p runs through the prime >= 5 and T(k) is the k-th central trinomial number (A002426).
- a(n) = (...(((x1^x2)^x3)^x4)^...) where x1,x2,... are the exponents in the prime factorization of n, a(1) = 0.A087179
a(n) = (...(((x1^x2)^x3)^x4)^...) where x1,x2,... are the exponents in the prime factorization of n, a(1) = 0.
- Number partition numbers <= P(n) of the form 3*k (P = A000041).A087180
Number partition numbers <= P(n) of the form 3*k (P = A000041).
- Number partition numbers <= P(n) of the form 3*k+1 (P = A000041).A087181
Number partition numbers <= P(n) of the form 3*k+1 (P = A000041).
- Number partition numbers <= P(n) of the form 3*k+2 (P = A000041).A087182
Number partition numbers <= P(n) of the form 3*k+2 (P = A000041).
- Partition numbers of the form 3*k.A087183
Partition numbers of the form 3*k.
- Partition numbers of the form 3*k+1.A087184
Partition numbers of the form 3*k+1.
- Partition numbers of the form 3*k+2.A087185
Partition numbers of the form 3*k+2.
- Q(p)/p where p runs through the primes and Q(k) is the k-th central quadrinomial coefficient (A005190).A087186
Q(p)/p where p runs through the primes and Q(k) is the k-th central quadrinomial coefficient (A005190).
- Number of ways to write n = i*p + j*q, where (p,q) is a twin prime pair and i,j>0.A087187
Number of ways to write n = i*p + j*q, where (p,q) is a twin prime pair and i,j>0.
- Number of partitions of n into distinct squarefree parts.A087188
Number of partitions of n into distinct squarefree parts.
- (P(p)-1)/2/p^2 where p runs through the odd primes different from 5 and P(k) is the k-th central pentanomial coefficient (A005191).A087189
(P(p)-1)/2/p^2 where p runs through the odd primes different from 5 and P(k) is the k-th central pentanomial coefficient (A005191).
- Numbers n such that n^4-(n+1)^3 is prime.A087190
Numbers n such that n^4-(n+1)^3 is prime.
- Primes of the form k^4 - (k+1)^3.A087191
Primes of the form k^4 - (k+1)^3.
- a(n) = ceiling(a(n-1)*4/3), with a(1) = 1.A087192
a(n) = ceiling(a(n-1)*4/3), with a(1) = 1.
- H(p)/p where p runs through the primes and H(k) is the k-th central hexanomial coefficient (A018901).A087193
H(p)/p where p runs through the primes and H(k) is the k-th central hexanomial coefficient (A018901).
- (A(p)-1)/(2*p^2) where p runs through the odd primes different from 7 and A(k) is the k-th central heptanomial coefficient (A025012).A087194
(A(p)-1)/(2*p^2) where p runs through the odd primes different from 7 and A(k) is the k-th central heptanomial coefficient (A025012).
- Numbers of the form 1+(1+p)*p^e, p prime and e>0.A087195
Numbers of the form 1+(1+p)*p^e, p prime and e>0.
- Primes of the form 1+(1+p)*p^e, p prime and e>0.A087196
Primes of the form 1+(1+p)*p^e, p prime and e>0.
- Decimal expansion of 1/sqrt(Pi).A087197
Decimal expansion of 1/sqrt(Pi).
- Decimal expansion of 1/(2*sqrt(Pi)).A087198
Decimal expansion of 1/(2*sqrt(Pi)).
- Decimal expansion of (3/(4*Pi))^(1/3).A087199
Decimal expansion of (3/(4*Pi))^(1/3).
- a(n) is the smallest m such that m > A005235(n) and A002110(n)+m is prime.A087200
a(n) is the smallest m such that m > A005235(n) and A002110(n)+m is prime.
- a(n) is the smallest m such that m > A055211(n) and A002110(n)-m is prime.A087201
a(n) is the smallest m such that m > A055211(n) and A002110(n)-m is prime.
- a(n) is the smallest m such that m > A037153(n) and n!+ m is prime.A087202
a(n) is the smallest m such that m > A037153(n) and n!+ m is prime.
- a(n) is the smallest m such that m > A037155(n) and n!- m is prime.A087203
a(n) is the smallest m such that m > A037155(n) and n!- m is prime.
- Period 6: repeat [2, 1, -1, -2, -1, 1].A087204
Period 6: repeat [2, 1, -1, -2, -1, 1].
- a(n) = -2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.A087205
a(n) = -2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.
- a(n) = 2*a(n-1) + 4*a(n-2); with a(0)=1, a(1)=4.A087206
a(n) = 2*a(n-1) + 4*a(n-2); with a(0)=1, a(1)=4.
- A binary representation of the primes that divide a number, shown in decimal.A087207
A binary representation of the primes that divide a number, shown in decimal.
- Expansion of e.g.f. exp(x)/(1-x^2).A087208
Expansion of e.g.f. exp(x)/(1-x^2).
- Numbers k such that k^2 = x^3 + y^4 with positive integers x, y.A087209
Numbers k such that k^2 = x^3 + y^4 with positive integers x, y.
- Numbers n such that n^2 can be expressed as x^3 + y^4 with positive integers x,y and gcd(n,x,y)=1.A087210
Numbers n such that n^2 can be expressed as x^3 + y^4 with positive integers x,y and gcd(n,x,y)=1.