Sequences
392,541 sequences
- Numbers n such that n^2048 + 1 is prime (a generalized Fermat prime).A088361
Numbers n such that n^2048 + 1 is prime (a generalized Fermat prime).
- Numbers k such that k^4096 + 1 is prime (a generalized Fermat prime).A088362
Numbers k such that k^4096 + 1 is prime (a generalized Fermat prime).
- Local minima of A053707 (first differences of A025475, powers of a prime but not prime).A088363
Local minima of A053707 (first differences of A025475, powers of a prime but not prime).
- a(n) = index of the n-th local minimum of A053707.A088364
a(n) = index of the n-th local minimum of A053707.
- Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).A088365
Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).
- a(n) = index of the n-th local maximum of A053707.A088366
a(n) = index of the n-th local maximum of A053707.
- Decimal expansion of Krivine's bound for Grothendieck's constant, Pi/(2*log(1+sqrt(2))).A088367
Decimal expansion of Krivine's bound for Grothendieck's constant, Pi/(2*log(1+sqrt(2))).
- G.f. satisfies: A(x) = Sum_{n>=0} n!*x^n*A(x)^n.A088368
G.f. satisfies: A(x) = Sum_{n>=0} n!*x^n*A(x)^n.
- Expansion of e.g.f. 1/(1 - x - x^2)^x.A088369
Expansion of e.g.f. 1/(1 - x - x^2)^x.
- Triangle T(n,k), read by rows, where the n-th row is a binary arrangement of the numbers 1 through n.A088370
Triangle T(n,k), read by rows, where the n-th row is a binary arrangement of the numbers 1 through n.
- Position where n is inserted into the n-th row of triangle A088370, where the n-th row differs from the prior row only by the presence of n.A088371
Position where n is inserted into the n-th row of triangle A088370, where the n-th row differs from the prior row only by the presence of n.
- Table read by rows where T(0,0)=0; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. T(n,T088208(n,j))=2^n-j, where T088208 is the table described in A088208.A088372
Table read by rows where T(0,0)=0; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. T(n,T088208(n,j))=2^n-j, where T088208 is the table described in A088208.
- Decimal expansion of a constant related to the postulated upper estimate for the complex Grothendieck constant.A088373
Decimal expansion of a constant related to the postulated upper estimate for the complex Grothendieck constant.
- Decimal expansion of a postulated upper estimate for the complex Grothendieck constant.A088374
Decimal expansion of a postulated upper estimate for the complex Grothendieck constant.
- Decimal expansion of a postulated upper estimate for the complex Grothendieck constant.A088375
Decimal expansion of a postulated upper estimate for the complex Grothendieck constant.
- Numbers k such that k divides the concatenation of all divisors of k in ascending order other than 1 and k itself.A088376
Numbers k such that k divides the concatenation of all divisors of k in ascending order other than 1 and k itself.
- a(n) = (smallest prime factor of n)^2; a(1) = 1.A088377
a(n) = (smallest prime factor of n)^2; a(1) = 1.
- a(n) = (smallest prime factor of n)^3; a(1) = 1.A088378
a(n) = (smallest prime factor of n)^3; a(1) = 1.
- a(n) = (smallest prime factor of n)^4; a(1) = 1.A088379
a(n) = (smallest prime factor of n)^4; a(1) = 1.
- Numbers not exceeding the cube of their smallest prime factor.A088380
Numbers not exceeding the cube of their smallest prime factor.
- Numbers greater than the cube of their smallest prime factor.A088381
Numbers greater than the cube of their smallest prime factor.
- Numbers not exceeding the 4th power of their smallest prime factor.A088382
Numbers not exceeding the 4th power of their smallest prime factor.
- Numbers greater than the 4th power of their smallest prime factor.A088383
Numbers greater than the 4th power of their smallest prime factor.
- Numbers n such that frac(x^n) is different from frac(x^i*frac(x^(n-i))) for any 1<=i<=n-1, where x=3/2 and frac(x) denotes the fractional part of x.A088384
Numbers n such that frac(x^n) is different from frac(x^i*frac(x^(n-i))) for any 1<=i<=n-1, where x=3/2 and frac(x) denotes the fractional part of x.
- a(n) = prime(n+1)^prime(n+1) - prime(n)^prime(n).A088385
a(n) = prime(n+1)^prime(n+1) - prime(n)^prime(n).
- a(n) = 2^n*(n!)^3.A088386
a(n) = 2^n*(n!)^3.
- Prime corresponding to largest prime power factor of n, a(1)=1.A088387
Prime corresponding to largest prime power factor of n, a(1)=1.
- Exponent of the largest prime power factor of n, a(1)=0.A088388
Exponent of the largest prime power factor of n, a(1)=0.
- Number of real regular n X n (0,1) matrices modulo rows permutations.A088389
Number of real regular n X n (0,1) matrices modulo rows permutations.
- Start of the first run of a string of exactly n successive integers in A088070.A088390
Start of the first run of a string of exactly n successive integers in A088070.
- a(n)=A069521(n)/n.A088391
a(n)=A069521(n)/n.
- a(n)=A069522(n)/n.A088392
a(n)=A069522(n)/n.
- a(n)=A069523(n)/n.A088393
a(n)=A069523(n)/n.
- a(n)=A069524(n)/n.A088394
a(n)=A069524(n)/n.
- a(n) = A069525(n)/n.A088395
a(n) = A069525(n)/n.
- a(n)=A069526(n)/n.A088396
a(n)=A069526(n)/n.
- a(n)=A069527(n)/n.A088397
a(n)=A069527(n)/n.
- a(n) = A069528(n)/n.A088398
a(n) = A069528(n)/n.
- a(n)=A069529(n)/n.A088399
a(n)=A069529(n)/n.
- a(n)=A069530(n)/n.A088400
a(n)=A069530(n)/n.
- Duplicate of A077491.A088401
Duplicate of A077491.
- Duplicate of A077492.A088402
Duplicate of A077492.
- Duplicate of A077495.A088403
Duplicate of A077495.
- a(n) = A069537(n)/2.A088404
a(n) = A069537(n)/2.
- a(n) = A052217(n)/3.A088405
a(n) = A052217(n)/3.
- a(n) = A063997(n)/4.A088406
a(n) = A063997(n)/4.
- a(n) = A069540(n)/5.A088407
a(n) = A069540(n)/5.
- a(n) = A062768(n)/6.A088408
a(n) = A062768(n)/6.
- a(n) = A063416(n)/7.A088409
a(n) = A063416(n)/7.
- a(n) = A069543(n)/8.A088410
a(n) = A069543(n)/8.