Sequences
392,541 sequences
- Numbers k such that 289*2^k + 1 is prime.A053361
Numbers k such that 289*2^k + 1 is prime.
- Numbers k such that 291*2^k + 1 is prime.A053362
Numbers k such that 291*2^k + 1 is prime.
- Numbers k such that 293*2^k + 1 is prime.A053363
Numbers k such that 293*2^k + 1 is prime.
- Numbers k such that 295*2^k + 1 is prime.A053364
Numbers k such that 295*2^k + 1 is prime.
- Numbers k such that 297*2^k + 1 is prime.A053365
Numbers k such that 297*2^k + 1 is prime.
- Numbers k such that 299*2^k + 1 is prime.A053366
Numbers k such that 299*2^k + 1 is prime.
- Partial sums of A050494.A053367
Partial sums of A050494.
- a(n) = (5n+2)*C(n) where C(n) = Catalan numbers (A000108).A053368
a(n) = (5n+2)*C(n) where C(n) = Catalan numbers (A000108).
- Linear recursion with Catalan numbers.A053369
Linear recursion with Catalan numbers.
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 1 mod 4.A053370
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 1 mod 4.
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 2 mod 4.A053371
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 2 mod 4.
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 3 mod 4.A053372
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 3 mod 4.
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 1 (mod 4).A053373
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 1 (mod 4).
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 2 mod 4.A053374
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 2 mod 4.
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 3 mod 4.A053375
Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 3 mod 4.
- a(n) contains n digits (either '1' or '8') and is divisible by 2^n.A053376
a(n) contains n digits (either '1' or '8') and is divisible by 2^n.
- a(n) contains n digits (either '3' or '8') and is divisible by 2^n.A053377
a(n) contains n digits (either '3' or '8') and is divisible by 2^n.
- a(n) contains n digits (either '5' or '8') and is divisible by 2^n.A053378
a(n) contains n digits (either '5' or '8') and is divisible by 2^n.
- a(n) contains n digits (either '7' or '8') and is divisible by 2^n.A053379
a(n) contains n digits (either '7' or '8') and is divisible by 2^n.
- a(n) contains n digits (either '8' or '9') and is divisible by 2^n.A053380
a(n) contains n digits (either '8' or '9') and is divisible by 2^n.
- Maximal number of linearly independent smooth nowhere-zero vector fields on a (2n+1)-sphere.A053381
Maximal number of linearly independent smooth nowhere-zero vector fields on a (2n+1)-sphere.
- Triangle T(n,k) giving numerator of coefficient of x^(n-k) in Bernoulli polynomial B(n, x), n >= 0, 0<=k<=n.A053382
Triangle T(n,k) giving numerator of coefficient of x^(n-k) in Bernoulli polynomial B(n, x), n >= 0, 0<=k<=n.
- Triangle T(n,k) giving denominator of coefficient of x^(n-k) in Bernoulli polynomial B(n, x), n >= 0, 0 <= k <= n.A053383
Triangle T(n,k) giving denominator of coefficient of x^(n-k) in Bernoulli polynomial B(n, x), n >= 0, 0 <= k <= n.
- a(n) = A053398(4,n).A053384
a(n) = A053398(4,n).
- A053398(5, n).A053385
A053398(5, n).
- A053398(6, n).A053386
A053398(6, n).
- A053398(7, n).A053387
A053398(7, n).
- a(n) = A053398(8, n).A053388
a(n) = A053398(8, n).
- A053398(9, n).A053389
A053398(9, n).
- a(n) = A053398(10, n).A053390
a(n) = A053398(10, n).
- Number of cycle types of direct products of two degree-n permutations.A053391
Number of cycle types of direct products of two degree-n permutations.
- a(n) is the concatenation of the sums of every pair of consecutive digits of n (with a(n) = 0 for 0 <= n <= 9).A053392
a(n) is the concatenation of the sums of every pair of consecutive digits of n (with a(n) = 0 for 0 <= n <= 9).
- Periodic points under the map A053392 that adds consecutive pairs of digits and concatenates them.A053393
Periodic points under the map A053392 that adds consecutive pairs of digits and concatenates them.
- The full list of 3-Kaprekar numbers.A053394
The full list of 3-Kaprekar numbers.
- Complete list of 4-Kaprekar numbers.A053395
Complete list of 4-Kaprekar numbers.
- The full list of 5-Kaprekar numbers.A053396
The full list of 5-Kaprekar numbers.
- The full list of 6-Kaprekar numbers.A053397
The full list of 6-Kaprekar numbers.
- Nim-values from game of Kopper's Nim.A053398
Nim-values from game of Kopper's Nim.
- A053398(3, n).A053399
A053398(3, n).
- Number of 3-multigraphs on n nodes.A053400
Number of 3-multigraphs on n nodes.
- Number of seconds in the time units: second, minute, hour, day, week, month, year, century, millennium, (a)eon.A053401
Number of seconds in the time units: second, minute, hour, day, week, month, year, century, millennium, (a)eon.
- Running distances (in meters) in Olympic athletics.A053402
Running distances (in meters) in Olympic athletics.
- Consider the set P of pairs (a,b) generated by the rules: (1,1) is in P; if (a,b) is in P then (b,a+b) is in P; if (a,b) and (a',b') are in P then (aa', bb') is in P. Sequence gives numbers not appearing in P.A053403
Consider the set P of pairs (a,b) generated by the rules: (1,1) is in P; if (a,b) is in P then (b,a+b) is in P; if (a,b) and (a',b') are in P then (aa', bb') is in P. Sequence gives numbers not appearing in P.
- Expansion of 1/((1+3*x)*(1-4*x)).A053404
Expansion of 1/((1+3*x)*(1-4*x)).
- Definition: A kara B = C, where C is the least nonnegative integer such that C * B >= A and C * (B-1) < A. a(n) is the smallest k such that n kara k is undefined.A053405
Definition: A kara B = C, where C is the least nonnegative integer such that C * B >= A and C * (B-1) < A. a(n) is the smallest k such that n kara k is undefined.
- Number of stars brighter than visual magnitude n-1.A053406
Number of stars brighter than visual magnitude n-1.
- Traditional type sizes (in typographic points) for printing.A053407
Traditional type sizes (in typographic points) for printing.
- Numbers k such that A003266(k) + 1 is prime.A053408
Numbers k such that A003266(k) + 1 is prime.
- Fibonacci numbers which are semiprimes.A053409
Fibonacci numbers which are semiprimes.
- a(1) = 0, a(2) = 16, a(2n+1) = 10*a(2n) - a(2n-1), a(2n) = 10*a(2n-1) - a(2n-2) + 16.A053410
a(1) = 0, a(2) = 16, a(2n+1) = 10*a(2n) - a(2n-1), a(2n) = 10*a(2n-1) - a(2n-2) + 16.