Sequences
392,541 sequences
- Pair-reversal of 1,4,4,16,16...A094361
Pair-reversal of 1,4,4,16,16...
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.A094362
McKay-Thompson series of class 39C for the Monster group with a(0) = 1.
- Expansion of (eta(q) * eta(q^39)) / (eta(q^3) * eta(q^13)) in powers of q.A094363
Expansion of (eta(q) * eta(q^39)) / (eta(q^3) * eta(q^13)) in powers of q.
- Expansion of (1-5*x)/(1-10*x-100*x^2).A094364
Expansion of (1-5*x)/(1-10*x-100*x^2).
- Number of numerical semigroups with three nonextraneous generators and Frobenius number n.A094365
Number of numerical semigroups with three nonextraneous generators and Frobenius number n.
- a(n) is the number of two-generated numerical semigroups whose Frobenius number is 2n-1.A094366
a(n) is the number of two-generated numerical semigroups whose Frobenius number is 2n-1.
- a(n) = the number of numerical semigroups with three generators and Frobenius number n.A094367
a(n) = the number of numerical semigroups with three generators and Frobenius number n.
- Triangle M(k,n) read by rows: coefficients of Meixner polynomials.A094368
Triangle M(k,n) read by rows: coefficients of Meixner polynomials.
- Numerator of Integrate_{x=0..n} binomial (x, n) dx.A094369
Numerator of Integrate_{x=0..n} binomial (x, n) dx.
- Denominator of Integrate_{x=0..n} binomial (x, n) dx.A094370
Denominator of Integrate_{x=0..n} binomial (x, n) dx.
- Numbers with incrementally smallest ratio A002034(n)/n.A094371
Numbers with incrementally smallest ratio A002034(n)/n.
- Denominators of incrementally smallest ratios A002034(n)/n.A094372
Denominators of incrementally smallest ratios A002034(n)/n.
- Expansion of (1-x-x^2)/((1-x)*(1-2*x)).A094373
Expansion of (1-x-x^2)/((1-x)*(1-2*x)).
- a(n) = (3^n-1)/2 + 2^n.A094374
a(n) = (3^n-1)/2 + 2^n.
- a(n) = (4^n - 2^n)/2 + 3^n.A094375
a(n) = (4^n - 2^n)/2 + 3^n.
- Least number having exactly n representations as ab+ac+bc with 0 < a < b < c.A094376
Least number having exactly n representations as ab+ac+bc with 0 < a < b < c.
- Greatest number having exactly n representations as ab+ac+bc with 0 < a < b < c.A094377
Greatest number having exactly n representations as ab+ac+bc with 0 < a < b < c.
- Number of numbers having exactly n representations as ab+ac+bc with 0 < a < b < c.A094378
Number of numbers having exactly n representations as ab+ac+bc with 0 < a < b < c.
- Least number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.A094379
Least number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.
- Greatest number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.A094380
Greatest number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.
- Number of numbers having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.A094381
Number of numbers having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.
- Number of quadruples (p, p+d, p+2*d, p+3*d) of primes with d>0 and p+3*d<=n.A094382
Number of quadruples (p, p+d, p+2*d, p+3*d) of primes with d>0 and p+3*d<=n.
- Primes p such that d>0 exists and p-d, p-2*d and p-3*d are also primes.A094383
Primes p such that d>0 exists and p-d, p-2*d and p-3*d are also primes.
- Determinant of n X n partial Hadamard matrix with coefficient m(i,j) 1<=i,j<=n (see comment).A094384
Determinant of n X n partial Hadamard matrix with coefficient m(i,j) 1<=i,j<=n (see comment).
- Triangle read by rows: T(n, k) = binomial(2*n, k-1)*binomial(2*n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0^n.A094385
Triangle read by rows: T(n, k) = binomial(2*n, k-1)*binomial(2*n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0^n.
- a(n) = floor(sqrt(3)*2^(n-1)).A094386
a(n) = floor(sqrt(3)*2^(n-1)).
- Numbers k such that gcd(k, A000120(k)) = 1.A094387
Numbers k such that gcd(k, A000120(k)) = 1.
- Expansion of (1- 2*x - x^2)/((1-x)*(1-3*x)).A094388
Expansion of (1- 2*x - x^2)/((1-x)*(1-3*x)).
- Last decimal digit of the odd Catalan number A038003(n).A094389
Last decimal digit of the odd Catalan number A038003(n).
- Beatty sequence of exp(Pi/4).A094390
Beatty sequence of exp(Pi/4).
- A Beatty sequence using exp(Pi/4)/(exp(Pi/4) - 1).A094391
A Beatty sequence using exp(Pi/4)/(exp(Pi/4) - 1).
- Antidiagonals of the tables formed from b(m,2,n,n), which is defined in Du 1989.A094392
Antidiagonals of the tables formed from b(m,2,n,n), which is defined in Du 1989.
- a(n) = floor(A058303*(2^(n-2)+1/2)).A094393
a(n) = floor(A058303*(2^(n-2)+1/2)).
- Odd composites m that divide Fibonacci(m)-1.A094394
Odd composites m that divide Fibonacci(m)-1.
- Odd composite n such that n divides Fibonacci(n) + 1.A094395
Odd composite n such that n divides Fibonacci(n) + 1.
- Numbers k such that k divides the (k-1)st Lucas number.A094396
Numbers k such that k divides the (k-1)st Lucas number.
- Numbers k such that k divides the (k+1)st Lucas number.A094397
Numbers k such that k divides the (k+1)st Lucas number.
- Numbers k that divide Lucas(k) + 1.A094398
Numbers k that divide Lucas(k) + 1.
- Odd numbers k that divide Lucas(k) + 1.A094399
Odd numbers k that divide Lucas(k) + 1.
- Odd n dividing Fibonacci(n)-1 but neither Fibonacci(n-1) nor Fibonacci(n+1).A094400
Odd n dividing Fibonacci(n)-1 but neither Fibonacci(n-1) nor Fibonacci(n+1).
- Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.A094401
Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.
- Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.A094402
Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.
- a(1) = 1; a(n) = (sum of previous terms)^n mod n.A094403
a(1) = 1; a(n) = (sum of previous terms)^n mod n.
- Numerators of low-water marks of mu(n)/n, where mu(n) is A002034.A094404
Numerators of low-water marks of mu(n)/n, where mu(n) is A002034.
- a(1) = 1; a(n) = (sum of previous terms) mod n.A094405
a(1) = 1; a(n) = (sum of previous terms) mod n.
- Smallest unhappy number that takes n steps to reach any of the unhappy cycle (4, 16, 37, 58, 89, 145, 42, 20) under iteration of sum of squares of digits map.A094406
Smallest unhappy number that takes n steps to reach any of the unhappy cycle (4, 16, 37, 58, 89, 145, 42, 20) under iteration of sum of squares of digits map.
- Primes of the form 16n+1.A094407
Primes of the form 16n+1.
- a(n) = Sum_{k = 0..n} 3^k*A085707(n,k).A094408
a(n) = Sum_{k = 0..n} 3^k*A085707(n,k).
- Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).A094409
Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).
- Numbers k that divide Fibonacci(k-1) but do not divide Fibonacci(k) - 1.A094410
Numbers k that divide Fibonacci(k-1) but do not divide Fibonacci(k) - 1.