Sequences
392,541 sequences
- 4-magic series constant.A052461
4-magic series constant.
- a(n) is the minimal positive integral solution k to 24*k == 1 (mod 5^n).A052462
a(n) is the minimal positive integral solution k to 24*k == 1 (mod 5^n).
- a(n) is the smallest nonnegative solution k to 24*k == 1 (mod 7^(2*n-2)).A052463
a(n) is the smallest nonnegative solution k to 24*k == 1 (mod 7^(2*n-2)).
- Fixed points for operation of repeatedly replacing a number with the sum of the fifth power of its digits.A052464
Fixed points for operation of repeatedly replacing a number with the sum of the fifth power of its digits.
- a(n) is the smallest positive integral solution k to 24*k == 1 (mod 11^n).A052465
a(n) is the smallest positive integral solution k to 24*k == 1 (mod 11^n).
- a(n) is the smallest positive solution k to 24*k == 1 (mod 13^n).A052466
a(n) is the smallest positive solution k to 24*k == 1 (mod 13^n).
- Binomial transform of {b(n)}, where b(n)=1 for prime n and b(n)=0 otherwise.A052467
Binomial transform of {b(n)}, where b(n)=1 for prime n and b(n)=0 otherwise.
- Numerators in the Taylor series for arccosh(x) - log(2*x).A052468
Numerators in the Taylor series for arccosh(x) - log(2*x).
- Denominators in the Taylor series for arccosh(x) - log(2*x).A052469
Denominators in the Taylor series for arccosh(x) - log(2*x).
- Conjectured orders of sociable numbers A003416.A052470
Conjectured orders of sociable numbers A003416.
- Number of noncaterpillar trees on n nodes (A000055-A005418).A052471
Number of noncaterpillar trees on n nodes (A000055-A005418).
- Number of independent components for a Weyl tensor in n dimensions.A052472
Number of independent components for a Weyl tensor in n dimensions.
- a(n) = binomial(2*n-5,n-2) + 2.A052473
a(n) = binomial(2*n-5,n-2) + 2.
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives main diagonal.A052474
Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives main diagonal.
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(5)).A052475
Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(5)).
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(2)).A052476
Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(2)).
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).A052477
Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(13)).A052478
Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(13)).
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(17)).A052479
Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(17)).
- Primes associated with A052507.A052480
Primes associated with A052507.
- a(n) = 2^n*(binomial(n,2) + 1).A052481
a(n) = 2^n*(binomial(n,2) + 1).
- a(n) = 2^(n-2)*binomial(n+1,2).A052482
a(n) = 2^(n-2)*binomial(n+1,2).
- Decimal expansion of Hausdorff dimension of Apollonian packing of circles.A052483
Decimal expansion of Hausdorff dimension of Apollonian packing of circles.
- Let P = all numbers that can be obtained by permuting the digits of n and possibly adding or omitting zeros; a(n) = |n-q| where q in P is the closest number to n different from n (a(n)=0 if no such q exists).A052484
Let P = all numbers that can be obtained by permuting the digits of n and possibly adding or omitting zeros; a(n) = |n-q| where q in P is the closest number to n different from n (a(n)=0 if no such q exists).
- Weak numbers (i.e., not powerful (1)): there is a prime p where p|n is true but p^2|n is not true.A052485
Weak numbers (i.e., not powerful (1)): there is a prime p where p|n is true but p^2|n is not true.
- Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power.A052486
Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power.
- Number of maximal irreducible integral matrix groups in n dimensions.A052487
Number of maximal irreducible integral matrix groups in n dimensions.
- a(n) = floor(n*H(n)) where H(n) is the n-th harmonic number, Sum_{k=1..n} 1/k (A001008/A002805).A052488
a(n) = floor(n*H(n)) where H(n) is the n-th harmonic number, Sum_{k=1..n} 1/k (A001008/A002805).
- Largest number that is n times sum of its decimal digits.A052489
Largest number that is n times sum of its decimal digits.
- Numbers k such that there is exactly one number which is k times the sum of its digits.A052490
Numbers k such that there is exactly one number which is k times the sum of its digits.
- Smallest "inconsummate number" in base n: smallest number such that in base n, no number is this multiple of the sum of its digits.A052491
Smallest "inconsummate number" in base n: smallest number such that in base n, no number is this multiple of the sum of its digits.
- Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.A052492
Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.
- Primes whose digits can be rearranged to give the initial terms of the decimal expansion of Pi.A052493
Primes whose digits can be rearranged to give the initial terms of the decimal expansion of Pi.
- Number of different primes that can be formed by permuting digits of n-th prime.A052494
Number of different primes that can be formed by permuting digits of n-th prime.
- Take n-th prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.A052495
Take n-th prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.
- Number of nonsingular n X n matrices over GF(8).A052496
Number of nonsingular n X n matrices over GF(8).
- Number of nonsingular n X n matrices over GF(9).A052497
Number of nonsingular n X n matrices over GF(9).
- Number of nonsingular n X n matrices over GF(11).A052498
Number of nonsingular n X n matrices over GF(11).
- If n is in the sequence then so are 2n and 4n-1.A052499
If n is in the sequence then so are 2n and 4n-1.
- A052484 / 9.A052500
A052484 / 9.
- Number of permutations sigma such that sigma^5=Id; degree-n permutations of order dividing 5.A052501
Number of permutations sigma such that sigma^5=Id; degree-n permutations of order dividing 5.
- Number of permutations sigma of [3n] without fixed points such that sigma^3 = Id.A052502
Number of permutations sigma of [3n] without fixed points such that sigma^3 = Id.
- Number of permutations sigma of [2n] without fixed points such that sigma^4 = Id.A052503
Number of permutations sigma of [2n] without fixed points such that sigma^4 = Id.
- Number of permutations sigma of [5n] without fixed points such that sigma^5 = Id.A052504
Number of permutations sigma of [5n] without fixed points such that sigma^5 = Id.
- Number of labeled 3-constrained functional graphs.A052505
Number of labeled 3-constrained functional graphs.
- Expansion of e.g.f. exp(x*exp(x)-x).A052506
Expansion of e.g.f. exp(x*exp(x)-x).
- Take n-th palindromic prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.A052507
Take n-th palindromic prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.
- Smallest number such that the largest set of positive real numbers whose sum and product equals the number falls short by n.A052508
Smallest number such that the largest set of positive real numbers whose sum and product equals the number falls short by n.
- Knights-move Pascal triangle: T(n,k), n >= 0, 0 <= k <= n; T(n,0) = T(n,n) = 1, T(n,k) = T(n-1,k) + T(n-2,k-1) for k = 1,2,...,n-1, n >= 2.A052509
Knights-move Pascal triangle: T(n,k), n >= 0, 0 <= k <= n; T(n,0) = T(n,n) = 1, T(n,k) = T(n-1,k) + T(n-2,k-1) for k = 1,2,...,n-1, n >= 2.
- Number of labeled planar binary trees with 2n-1 elements (external nodes or internal nodes).A052510
Number of labeled planar binary trees with 2n-1 elements (external nodes or internal nodes).