Sequences
392,541 sequences
- Primes of the form (k+1)^k + k^(k-1), k >= 1.A054461
Primes of the form (k+1)^k + k^(k-1), k >= 1.
- Numbers k such that (k+1)^k + k^(k-1) is prime.A054462
Numbers k such that (k+1)^k + k^(k-1) is prime.
- Numbers k such that (k+1)^k - k^(k-1) is prime.A054463
Numbers k such that (k+1)^k - k^(k-1) is prime.
- Numbers n such that Sum_{k=1..n} d(k) is an integer where d(k) is the decimal fraction 0.k (e.g. d(999)=0.999).A054464
Numbers n such that Sum_{k=1..n} d(k) is an integer where d(k) is the decimal fraction 0.k (e.g. d(999)=0.999).
- Numbers k such that Sum_{j=1..k} d(j) is an integer where d(j) is the decimal fraction 0.2j (e.g., d(14) = 0.28).A054465
Numbers k such that Sum_{j=1..k} d(j) is an integer where d(j) is the decimal fraction 0.2j (e.g., d(14) = 0.28).
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order two under binary matrix multiplication.A054466
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order two under binary matrix multiplication.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order four under binary matrix multiplication.A054467
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order four under binary matrix multiplication.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order six under binary matrix multiplication.A054468
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order six under binary matrix multiplication.
- a(n) = a(n-1) + a(n-2) + (n+2)*binomial(n+3, 3)/2, with a(0) = 1, a(1) = 7.A054469
a(n) = a(n-1) + a(n-2) + (n+2)*binomial(n+3, 3)/2, with a(0) = 1, a(1) = 7.
- Partial sums of A054469.A054470
Partial sums of A054469.
- Smallest prime p having n different cycles in decimal expansions of k/p, k=1..p-1.A054471
Smallest prime p having n different cycles in decimal expansions of k/p, k=1..p-1.
- Number of ways to color faces of an icosahedron using at most n colors.A054472
Number of ways to color faces of an icosahedron using at most n colors.
- Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.A054473
Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.
- Number of walks on square lattice that start and end at origin after 2n steps, not touching origin at intermediate stages.A054474
Number of walks on square lattice that start and end at origin after 2n steps, not touching origin at intermediate stages.
- Numbers not divisible by any of their digits when written in base 4.A054475
Numbers not divisible by any of their digits when written in base 4.
- Numbers not divisible by any of their digits when written in base 5.A054476
Numbers not divisible by any of their digits when written in base 5.
- A Pellian-related sequence.A054477
A Pellian-related sequence.
- Numbers not divisible by any of their digits when written in base 6.A054478
Numbers not divisible by any of their digits when written in base 6.
- Number of sets of cycle graphs of 2n nodes where the 2-colored edges alternate colors.A054479
Number of sets of cycle graphs of 2n nodes where the 2-colored edges alternate colors.
- Number of different positive braids with n crossings of 4 strands.A054480
Number of different positive braids with n crossings of 4 strands.
- Highest common factor of successive highly composite numbers (1), A002182.A054481
Highest common factor of successive highly composite numbers (1), A002182.
- Denominator of lowest terms fraction from division of a highly composite number (1) by its predecessor.A054482
Denominator of lowest terms fraction from division of a highly composite number (1) by its predecessor.
- Numerator of lowest terms fraction from division of a highly composite number (1) by its predecessor.A054483
Numerator of lowest terms fraction from division of a highly composite number (1) by its predecessor.
- Numbers not divisible by any of their digits when written in base 7.A054484
Numbers not divisible by any of their digits when written in base 7.
- Expansion of (1+3*x)/(1-4*x+x^2).A054485
Expansion of (1+3*x)/(1-4*x+x^2).
- Expansion of (1+2*x)/(1-3*x+x^2).A054486
Expansion of (1+2*x)/(1-3*x+x^2).
- a(n) = (3*n+4)*binomial(n+7, 7)/4.A054487
a(n) = (3*n+4)*binomial(n+7, 7)/4.
- Expansion of (1+2*x)/(1-6*x+x^2).A054488
Expansion of (1+2*x)/(1-6*x+x^2).
- Expansion of (1+4*x)/(1-6*x+x^2).A054489
Expansion of (1+4*x)/(1-6*x+x^2).
- Expansion of (1+5*x)/(1-6*x+x^2).A054490
Expansion of (1+5*x)/(1-6*x+x^2).
- a(n) = 4*a(n-1) - a(n-2), a(0)=1, a(1)=6.A054491
a(n) = 4*a(n-1) - a(n-2), a(0)=1, a(1)=6.
- a(n) = 3*a(n-1) - a(n-2), a(0)=1, a(1)=6.A054492
a(n) = 3*a(n-1) - a(n-2), a(0)=1, a(1)=6.
- A Pellian-related recursive sequence.A054493
A Pellian-related recursive sequence.
- Largest Fibonacci factor of n.A054494
Largest Fibonacci factor of n.
- Smallest k such that n/k is a Fibonacci number.A054495
Smallest k such that n/k is a Fibonacci number.
- If n = p_1^e_1 * p_2^e_2 * p_3^e_3 * ..., p's = distinct primes, e's = positive integers, then a(n) = p_1^(e_1^2) * p_2^(e_2^2) * p_3^(e_3^2) * ... .A054496
If n = p_1^e_1 * p_2^e_2 * p_3^e_3 * ..., p's = distinct primes, e's = positive integers, then a(n) = p_1^(e_1^2) * p_2^(e_2^2) * p_3^(e_3^2) * ... .
- Number of symmetric nonnegative integer 7 X 7 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.A054497
Number of symmetric nonnegative integer 7 X 7 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.
- Number of symmetric nonnegative integer 8 X 8 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.A054498
Number of symmetric nonnegative integer 8 X 8 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.
- Number of pairings on a bracelet; number of chord diagrams that can be turned over and having n chords.A054499
Number of pairings on a bracelet; number of chord diagrams that can be turned over and having n chords.
- Indicator sequence for classification of nonattacking queens on n X n toroidal board.A054500
Indicator sequence for classification of nonattacking queens on n X n toroidal board.
- Multiplicity sequence for classification of nonattacking queens on n X n toroidal board.A054501
Multiplicity sequence for classification of nonattacking queens on n X n toroidal board.
- Counting sequence for classification of nonattacking queens on n X n toroidal board.A054502
Counting sequence for classification of nonattacking queens on n X n toroidal board.
- Table T(n,k) giving log_b(k), 1<=k<=p, where p = n-th prime and b = smallest primitive root of p (A001918).A054503
Table T(n,k) giving log_b(k), 1<=k<=p, where p = n-th prime and b = smallest primitive root of p (A001918).
- Numbers n such that Mordell's equation y^2 = x^3 + n has no integral solutions.A054504
Numbers n such that Mordell's equation y^2 = x^3 + n has no integral solutions.
- Log_b 2 where b is smallest primitive root (A001918) mod n-th prime.A054505
Log_b 2 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 3 where b is smallest primitive root (A001918) mod n-th prime.A054506
Log_b 3 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 4 where b is smallest primitive root (A001918) mod n-th prime.A054507
Log_b 4 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 5 where b is smallest primitive root (A001918) mod n-th prime.A054508
Log_b 5 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 6 where b is smallest primitive root (A001918) mod n-th prime.A054509
Log_b 6 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 7 where b is smallest primitive root (A001918) mod n-th prime.A054510
Log_b 7 where b is smallest primitive root (A001918) mod n-th prime.