Sequences
392,541 sequences
- A088257 indexed by A002110.A088411
A088257 indexed by A002110.
- A088258 indexed by A000142.A088412
A088258 indexed by A000142.
- A088259 indexed by A001597.A088413
A088259 indexed by A001597.
- A088260 indexed by A002110.A088414
A088260 indexed by A002110.
- Primes p = prime(i) such that p(i)# - p(i+1) or p(i)# + p(i+1) or both are primes.A088415
Primes p = prime(i) such that p(i)# - p(i+1) or p(i)# + p(i+1) or both are primes.
- A088415 indexed by A000040.A088416
A088415 indexed by A000040.
- a(n) = A088339(n)/3.A088417
a(n) = A088339(n)/3.
- a(1) = 5, a(n) = smallest odd multiple of a(n-1) that contains all the decimal digits of a(n-1).A088418
a(1) = 5, a(n) = smallest odd multiple of a(n-1) that contains all the decimal digits of a(n-1).
- a(n) = A088418(n+1)/A088418(n).A088419
a(n) = A088418(n+1)/A088418(n).
- Number of primes in arithmetic progression starting with 3 and with d = 2n.A088420
Number of primes in arithmetic progression starting with 3 and with d = 2n.
- Number of primes in arithmetic progression starting with 5 and with d=2n.A088421
Number of primes in arithmetic progression starting with 5 and with d=2n.
- Number of primes in arithmetic progression starting with 7 and with d=2n.A088422
Number of primes in arithmetic progression starting with 7 and with d=2n.
- a(n) is the number of primes in arithmetic progression starting with 11 and with d = 2n.A088423
a(n) is the number of primes in arithmetic progression starting with 11 and with d = 2n.
- Number of primes in arithmetic progression starting with 13 and with d=2n.A088424
Number of primes in arithmetic progression starting with 13 and with d=2n.
- Number of primes in arithmetic progression starting with 17 and with d=2n.A088425
Number of primes in arithmetic progression starting with 17 and with d=2n.
- Number of primes in arithmetic progression starting with 19 and with d=2n.A088426
Number of primes in arithmetic progression starting with 19 and with d=2n.
- Number of primes in arithmetic progression starting with 23 and with d=2n.A088427
Number of primes in arithmetic progression starting with 23 and with d=2n.
- Number of primes in arithmetic progression starting with 29 and with d=2n.A088428
Number of primes in arithmetic progression starting with 29 and with d=2n.
- Number of primes in arithmetic progression starting with 31 and with d=2n.A088429
Number of primes in arithmetic progression starting with 31 and with d=2n.
- a(n) = the least positive d such that for p=prime(n), the numbers p+0d, p+1d, p+2d, ..., p+(p-1)d are all primes.A088430
a(n) = the least positive d such that for p=prime(n), the numbers p+0d, p+1d, p+2d, ..., p+(p-1)d are all primes.
- Half of the (n+1)-st component of the continued fraction expansion of Sum_{k>=0} 1/2^(2^k).A088431
Half of the (n+1)-st component of the continued fraction expansion of Sum_{k>=0} 1/2^(2^k).
- Number of ways to write n as n = u*v*w with 1 <= u < v <= w.A088432
Number of ways to write n as n = u*v*w with 1 <= u < v <= w.
- Number of ways to write n as n = u*v*w with 1<=u<=v<w.A088433
Number of ways to write n as n = u*v*w with 1<=u<=v<w.
- Number of ways to write n as n = u*v*w with 1 <= u < v < w.A088434
Number of ways to write n as n = u*v*w with 1 <= u < v < w.
- 1/2 + half of the (n+1)-st component of the continued fraction expansion of sum(k>=1,1/3^(2^k)).A088435
1/2 + half of the (n+1)-st component of the continued fraction expansion of sum(k>=1,1/3^(2^k)).
- Number of permutations in the symmetric group S_n that have exactly one transposition in their cycle decomposition.A088436
Number of permutations in the symmetric group S_n that have exactly one transposition in their cycle decomposition.
- Number of n X n orthogonal matrices over GF(2) modulo permutations of rows.A088437
Number of n X n orthogonal matrices over GF(2) modulo permutations of rows.
- A chaotic Cantor integer type product set of the factorial function that trifurcates.A088438
A chaotic Cantor integer type product set of the factorial function that trifurcates.
- a(3n) = 3n, otherwise a(n) = 1.A088439
a(3n) = 3n, otherwise a(n) = 1.
- a(4n) = 4n, otherwise a(n) = 1.A088440
a(4n) = 4n, otherwise a(n) = 1.
- a(n) = n if n == 0 (mod 3), a(n) = 1 if n == 2 (mod 3), otherwise a(n) = floor((n-2)/2).A088441
a(n) = n if n == 0 (mod 3), a(n) = 1 if n == 2 (mod 3), otherwise a(n) = floor((n-2)/2).
- A linear version of the Josephus problem.A088442
A linear version of the Josephus problem.
- A linear version of the Josephus problem: a(n) = the function w_3(n).A088443
A linear version of the Josephus problem: a(n) = the function w_3(n).
- Smallest divisor d of n such that all intervals [(k-1)*d+1:k*d] contain at least one prime, 1<=k<=n/d; a(1)=1.A088444
Smallest divisor d of n such that all intervals [(k-1)*d+1:k*d] contain at least one prime, 1<=k<=n/d; a(1)=1.
- a(n) = n / A088444(n), where A088444(n) is the smallest divisor d of n such that all intervals [(k-1)*d+1:k*d] contain at least one prime, 1<=k<=n/d; a(1)=1.A088445
a(n) = n / A088444(n), where A088444(n) is the smallest divisor d of n such that all intervals [(k-1)*d+1:k*d] contain at least one prime, 1<=k<=n/d; a(1)=1.
- Number of numbers m with A088444(m) = n.A088446
Number of numbers m with A088444(m) = n.
- Smallest number m with A088444(m) = n.A088447
Smallest number m with A088444(m) = n.
- Greatest number m with A088444(m) = n.A088448
Greatest number m with A088444(m) = n.
- Numbers n such that A088444(n) is not prime.A088449
Numbers n such that A088444(n) is not prime.
- Numbers k such that A088444(k) = smallest prime factor of k.A088450
Numbers k such that A088444(k) = smallest prime factor of k.
- Numbers k such that A088444(k) = greatest prime factor of k.A088451
Numbers k such that A088444(k) = greatest prime factor of k.
- The survivor w(n,4) in a modified Josephus problem, with a step of 4.A088452
The survivor w(n,4) in a modified Josephus problem, with a step of 4.
- Decimal expansion of 1/zeta(3).A088453
Decimal expansion of 1/zeta(3).
- Decimal expansion of 6/(Catalan*Pi^2).A088454
Decimal expansion of 6/(Catalan*Pi^2).
- Triangle T(n,k) of number of integer sequences [y(1),...,y(n)] such that |y(i)-y(i+1)|<=1, 1=y(1)<=y(i)<=k=y(n).A088455
Triangle T(n,k) of number of integer sequences [y(1),...,y(n)] such that |y(i)-y(i+1)|<=1, 1=y(1)<=y(i)<=k=y(n).
- Number of integer sequences [y(1),...,y(n)] such that |y(i)-y(i+1)|<=1, 1=y(1)<=y(i)<=y(n).A088456
Number of integer sequences [y(1),...,y(n)] such that |y(i)-y(i+1)|<=1, 1=y(1)<=y(i)<=y(n).
- Number of single nodes (exactly one node on that level) for all Motzkin paths of length n.A088457
Number of single nodes (exactly one node on that level) for all Motzkin paths of length n.
- a(n) equals the number of partial quotients of the simple continued fraction expansion of the nonsimple continued fraction: 1/(1+2/(2+3/(3+...+n/n)))).A088458
a(n) equals the number of partial quotients of the simple continued fraction expansion of the nonsimple continued fraction: 1/(1+2/(2+3/(3+...+n/n)))).
- Triangle read by rows: T(n,k) represents the number of lozenge tilings of an (n,1,n)-hexagon which include the non-vertical tile above the main diagonal starting in position k+1.A088459
Triangle read by rows: T(n,k) represents the number of lozenge tilings of an (n,1,n)-hexagon which include the non-vertical tile above the main diagonal starting in position k+1.
- Lower twin primes with lower twin prime index.A088460
Lower twin primes with lower twin prime index.