Sequences
392,541 sequences
- Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).A081411
Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).
- Largest prime divisors of differences between consecutive primes.A081412
Largest prime divisors of differences between consecutive primes.
- a(n) is the smallest prime p such that the largest prime divisor of the difference nextprime(p) - p equals the n-th prime, prime(n).A081413
a(n) is the smallest prime p such that the largest prime divisor of the difference nextprime(p) - p equals the n-th prime, prime(n).
- Largest prime divisor of prime(2^n+1) - prime(2^n).A081414
Largest prime divisor of prime(2^n+1) - prime(2^n).
- Triply balanced primes: primes which are averages of both their immediate neighbor, their second neighbors and their third neighbors.A081415
Triply balanced primes: primes which are averages of both their immediate neighbor, their second neighbors and their third neighbors.
- Duplicate of A051795.A081416
Duplicate of A051795.
- A000720 applied to Pascal-triangle: primepi(C(n,j)), j,0..n and n=0,1,2,...A081417
A000720 applied to Pascal-triangle: primepi(C(n,j)), j,0..n and n=0,1,2,...
- Triangle read by rows: T(n,k) = binomial(primepi(n), primepi(j)), j=0..n and n>=0.A081418
Triangle read by rows: T(n,k) = binomial(primepi(n), primepi(j)), j=0..n and n>=0.
- Largest value held in any register at the end of a halting computation by an n-instruction register Minsky machine.A081419
Largest value held in any register at the end of a halting computation by an n-instruction register Minsky machine.
- Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.A081420
Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.
- a(n) = (3^(2*n) + 5^(2*n)) / 2.A081421
a(n) = (3^(2*n) + 5^(2*n)) / 2.
- Triangle read by rows in which row n consists of the first n+1 n-gonal numbers.A081422
Triangle read by rows in which row n consists of the first n+1 n-gonal numbers.
- Subdiagonal of array of n-gonal numbers A081422.A081423
Subdiagonal of array of n-gonal numbers A081422.
- Class 5- primes (for definition see A005109).A081424
Class 5- primes (for definition see A005109).
- Class 6- primes (for definition see A005109).A081425
Class 6- primes (for definition see A005109).
- Class 7- primes.A081426
Class 7- primes.
- Class 8- primes.A081427
Class 8- primes.
- Class 9- primes.A081428
Class 9- primes.
- Class 10- primes.A081429
Class 10- primes.
- Class 11- primes.A081430
Class 11- primes.
- RevBinary(RevDecimal(n)), where RevBinary(m) is the binary reversal of m (A030101) and RevDecimal(m) is the decimal reversal of m (A004086).A081431
RevBinary(RevDecimal(n)), where RevBinary(m) is the binary reversal of m (A030101) and RevDecimal(m) is the decimal reversal of m (A004086).
- RevDecimal(RevBinary(n)), where RevDecimal(m) is the decimal reversal of m (A004086) and RevBinary(m) is the binary reversal of m (A030101).A081432
RevDecimal(RevBinary(n)), where RevDecimal(m) is the decimal reversal of m (A004086) and RevBinary(m) is the binary reversal of m (A030101).
- Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).A081433
Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).
- Numbers such that RevBinary() = RevDecimal(), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).A081434
Numbers such that RevBinary() = RevDecimal(), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).
- Diagonal in array of n-gonal numbers A081422.A081435
Diagonal in array of n-gonal numbers A081422.
- Fifth subdiagonal in array of n-gonal numbers A081422.A081436
Fifth subdiagonal in array of n-gonal numbers A081422.
- Diagonal in array of n-gonal numbers A081422.A081437
Diagonal in array of n-gonal numbers A081422.
- Diagonal in array of n-gonal numbers A081422.A081438
Diagonal in array of n-gonal numbers A081422.
- Expansion of exp(2*x)*cosh(x/sqrt(1 - x^2)).A081439
Expansion of exp(2*x)*cosh(x/sqrt(1 - x^2)).
- Expansion of e.g.f.: exp(x)*cosh(x/sqrt(1 - x^2)).A081440
Expansion of e.g.f.: exp(x)*cosh(x/sqrt(1 - x^2)).
- a(n) = (2*n^3 - n^2 - n + 2)/2.A081441
a(n) = (2*n^3 - n^2 - n + 2)/2.
- Expansion of e.g.f.: cosh(x/sqrt(1-x^2)) (even powers).A081442
Expansion of e.g.f.: cosh(x/sqrt(1-x^2)) (even powers).
- Binomial transform of expansion of cosh(sinh(x)).A081443
Binomial transform of expansion of cosh(sinh(x)).
- Second binomial transform of expansion of cosh(sinh(x)).A081444
Second binomial transform of expansion of cosh(sinh(x)).
- Smallest squares such that partial sums of the sequence plus 11 are primes.A081445
Smallest squares such that partial sums of the sequence plus 11 are primes.
- a(n) = sqrt( A081445(n) )/6.A081446
a(n) = sqrt( A081445(n) )/6.
- Smallest squares such that partial sums of the sequence plus 5 are primes.A081447
Smallest squares such that partial sums of the sequence plus 5 are primes.
- a(n) = sqrt( A081447(n) )/6.A081448
a(n) = sqrt( A081447(n) )/6.
- Smallest squares such that partial sums of the sequence plus 17 are primes.A081449
Smallest squares such that partial sums of the sequence plus 17 are primes.
- a(n) = sqrt(A081449(n))/6.A081450
a(n) = sqrt(A081449(n))/6.
- Partial maxima of A081446.A081451
Partial maxima of A081446.
- Partial maxima of A081448.A081452
Partial maxima of A081448.
- Partial maxima of A081450.A081453
Partial maxima of A081450.
- Triangle read by rows in which the n-th row contains n distinct numbers whose product is a square, which is minimal over all choices for n distinct numbers.A081454
Triangle read by rows in which the n-th row contains n distinct numbers whose product is a square, which is minimal over all choices for n distinct numbers.
- Final entry of n-th row of triangle in A081454.A081455
Final entry of n-th row of triangle in A081454.
- Product of entries in n-th row of triangle in A081454.A081456
Product of entries in n-th row of triangle in A081454.
- a(n) = A081456(n)^(1/2).A081457
a(n) = A081456(n)^(1/2).
- Table T(m,n) = (3^m + 5^n)/2, for m, n = 0, 2, 4, 6, ... read by antidiagonals downwards.A081458
Table T(m,n) = (3^m + 5^n)/2, for m, n = 0, 2, 4, 6, ... read by antidiagonals downwards.
- Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with r = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, ..., tending to N^(1/2). Sequence gives values of the numerators.A081459
Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with r = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, ..., tending to N^(1/2). Sequence gives values of the numerators.
- Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with a = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, ..., tending to N^(1/2). Sequence gives values of the denominators.A081460
Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with a = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, ..., tending to N^(1/2). Sequence gives values of the denominators.