Sequences
392,541 sequences
- Primes of the form 16*m^2 + 81, m=1,2,3,...A087861
Primes of the form 16*m^2 + 81, m=1,2,3,...
- Primes of the form 16*m^2 + 169, m=1,2,3,...A087862
Primes of the form 16*m^2 + 169, m=1,2,3,...
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.A087863
a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.
- Primes generated from A039726.A087864
Primes generated from A039726.
- Prime numbers of the form primepi(3^m), for some integer m.A087865
Prime numbers of the form primepi(3^m), for some integer m.
- Composition length of the n-th symmetric power of the natural representation of a finite subgroup of SL(2,C) of type E_8 (binary icosahedral group).A087866
Composition length of the n-th symmetric power of the natural representation of a finite subgroup of SL(2,C) of type E_8 (binary icosahedral group).
- n^2-79*n+1601 as n runs through the lucky numbers.A087867
n^2-79*n+1601 as n runs through the lucky numbers.
- a[n] =Abs[Abs[Prime[n]-a[n-1]]+Abs[Prime[n]-a[n-2]]+Abs[Prime[n]-a[n-3]]-Abs[Prime[n]-a[n-4]]].A087868
a[n] =Abs[Abs[Prime[n]-a[n-1]]+Abs[Prime[n]-a[n-2]]+Abs[Prime[n]-a[n-3]]-Abs[Prime[n]-a[n-4]]].
- a[n] =Abs[Abs[Prime[n]-a[n-1]]+Abs[Prime[n]-a[n-2]]+Abs[Prime[n]-a[n-3]]-Abs[Prime[n]-a[n-4]]-Abs[Prime[n]-a[n-5]]].A087869
a[n] =Abs[Abs[Prime[n]-a[n-1]]+Abs[Prime[n]-a[n-2]]+Abs[Prime[n]-a[n-3]]-Abs[Prime[n]-a[n-4]]-Abs[Prime[n]-a[n-5]]].
- Primes of the form (4n+1)^2 + (4m+2)^2 where n=1,2,3.., m=1,2,3..A087870
Primes of the form (4n+1)^2 + (4m+2)^2 where n=1,2,3.., m=1,2,3..
- Primes of the form (4*k + 1)^2 + (4*k + 2)^2 where k=0,1,2,3,...A087871
Primes of the form (4*k + 1)^2 + (4*k + 2)^2 where k=0,1,2,3,...
- Primes of the form (4*k + 3)^2 + (4*k + 2)^2 where k=0,1,2,3,...A087872
Primes of the form (4*k + 3)^2 + (4*k + 2)^2 where k=0,1,2,3,...
- a(n)=a(a(n-1))+a(n-a(n-1)) p(a(n))=n, b(n)=p(p(n-1))+a(n-a(n-1)).A087873
a(n)=a(a(n-1))+a(n-a(n-1)) p(a(n))=n, b(n)=p(p(n-1))+a(n-a(n-1)).
- a[n] =PrimePi[PrimePi[n-1]] + a[n - a[n-1]].A087874
a[n] =PrimePi[PrimePi[n-1]] + a[n - a[n-1]].
- a[n] = pi[n-pi[n-1]] + a[n - a[n-2]], where pi(x) = number of primes <= x.A087875
a[n] = pi[n-pi[n-1]] + a[n - a[n-2]], where pi(x) = number of primes <= x.
- a[n] =PrimePi[PrimePi[n-2]] + a[n - a[n-2]].A087876
a[n] =PrimePi[PrimePi[n-2]] + a[n - a[n-2]].
- Primes of the form (4n+1)^2 + (4m)^2, m,n = 0,1,2..A087877
Primes of the form (4n+1)^2 + (4m)^2, m,n = 0,1,2..
- Primes of the form (4n+3)^2 + (4m)^2, m,n = 0,1,2..A087878
Primes of the form (4n+3)^2 + (4m)^2, m,n = 0,1,2..
- Primes of the form (4n+1)^2 + (4m+2)^2, m,n >= 0.A087879
Primes of the form (4n+1)^2 + (4m+2)^2, m,n >= 0.
- Primes of the form (4n+3)^2 + (4m+2)^2, m,n = 0,1,2..A087880
Primes of the form (4n+3)^2 + (4m+2)^2, m,n = 0,1,2..
- a(n) = Prime[Prime[n-1]] + PrimePi[Abs[n - PrimePi[n-1]]].A087881
a(n) = Prime[Prime[n-1]] + PrimePi[Abs[n - PrimePi[n-1]]].
- a(n) = Prime[Abs[n-Prime[n-1]]] + PrimePi[ n- PrimePi[n-2]].A087882
a(n) = Prime[Abs[n-Prime[n-1]]] + PrimePi[ n- PrimePi[n-2]].
- a(n) = PrimePi[n-PrimePi[n-1]] + Prime[Abs[n - Prime[n-2]]].A087883
a(n) = PrimePi[n-PrimePi[n-1]] + Prime[Abs[n - Prime[n-2]]].
- a(n) = PrimePi[PrimePi[n-1]] + Prime[Abs[n - Prime[n-1]]].A087884
a(n) = PrimePi[PrimePi[n-1]] + Prime[Abs[n - Prime[n-1]]].
- Numbers k such that 5^k + 2 is a prime.A087885
Numbers k such that 5^k + 2 is a prime.
- Numbers n such that 29^n + 2 is prime.A087886
Numbers n such that 29^n + 2 is prime.
- a(n) = 18n^3 + 6n^2.A087887
a(n) = 18n^3 + 6n^2.
- Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).A087888
Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).
- Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).A087889
Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).
- Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).A087890
Given a sequence u consisting just of 1's and 2's, let f(u)(n) be the length of n-th run. Then we may define a sequence u = {a(n)} by a(n)=f^(n-1)(u)(1) (starting with n=1).
- Number of nonsquarefree terms in 3x+1 trajectory started at n.A087891
Number of nonsquarefree terms in 3x+1 trajectory started at n.
- Duplicate of A078372.A087892
Duplicate of A078372.
- Number of numbers m satisfying 1 < m < n such that m^2 == m (mod n).A087893
Number of numbers m satisfying 1 < m < n such that m^2 == m (mod n).
- Primes p such that 9^p - 8^p is composite.A087894
Primes p such that 9^p - 8^p is composite.
- Primes p such that 10^p - 9^p is composite.A087895
Primes p such that 10^p - 9^p is composite.
- Least prime p such that n^p - (n-1)^p is composite.A087896
Least prime p such that n^p - (n-1)^p is composite.
- Number of partitions of n into odd parts greater than 1.A087897
Number of partitions of n into odd parts greater than 1.
- Choose a(n) so that 2*3*5*13*...*a(n) - 1 is prime; a(n) is prime; and a(n) > a(n-1).A087898
Choose a(n) so that 2*3*5*13*...*a(n) - 1 is prime; a(n) is prime; and a(n) > a(n-1).
- Primes associated with A087898.A087899
Primes associated with A087898.
- 2*3*5*6*...*a(n) -+ 1 are primes, with a(n+1) > a(n).A087900
2*3*5*6*...*a(n) -+ 1 are primes, with a(n+1) > a(n).
- Twin primes associated with A087900.A087901
Twin primes associated with A087900.
- Least m such that A080256(m)=n and has a maximum number A000792(n) of divisors.A087902
Least m such that A080256(m)=n and has a maximum number A000792(n) of divisors.
- Triangle read by rows of the numbers T(n,k) (n > 1, 0 < k < n) of set partitions of n of length k which do not have a proper subset of parts with a union equal to a subset {1,2,...,j} with j < n.A087903
Triangle read by rows of the numbers T(n,k) (n > 1, 0 < k < n) of set partitions of n of length k which do not have a proper subset of parts with a union equal to a subset {1,2,...,j} with j < n.
- a(n) = the number of twin primes j*(p(n)#)+-1, for 1<=j<(p(n+1))^2.A087904
a(n) = the number of twin primes j*(p(n)#)+-1, for 1<=j<(p(n+1))^2.
- a(n) = n! * Sum_{d|n} (d/n)^d.A087905
a(n) = n! * Sum_{d|n} (d/n)^d.
- a(n) = Sum_{d|n} (n-1)!/(d-1)!.A087906
a(n) = Sum_{d|n} (n-1)!/(d-1)!.
- Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).A087907
Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).
- Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.A087908
Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.
- a(n) = Sum_{d|n} (n/d)^(d-1).A087909
a(n) = Sum_{d|n} (n/d)^(d-1).
- Exponent of the greatest power of 2 dividing the numerator of 2^1/1 + 2^2/2 + 2^3/3 + ... + 2^n/n.A087910
Exponent of the greatest power of 2 dividing the numerator of 2^1/1 + 2^2/2 + 2^3/3 + ... + 2^n/n.