Sequences
392,541 sequences
- Let S_n be the set {n!/(i!*j!*k!) | i, j, k > 0, i+j+k = n} (i.e., trinomial coefficients that involve all three monomials). Then a(n) is the smallest gcd of any three members of S_n.A092461
Let S_n be the set {n!/(i!*j!*k!) | i, j, k > 0, i+j+k = n} (i.e., trinomial coefficients that involve all three monomials). Then a(n) is the smallest gcd of any three members of S_n.
- n times the coefficient of x^n in log[1 + sum(k>=0, x^2^k)].A092462
n times the coefficient of x^n in log[1 + sum(k>=0, x^2^k)].
- Greatest number in the n-th successive group of natural numbers containing exactly n prime powers.A092463
Greatest number in the n-th successive group of natural numbers containing exactly n prime powers.
- Numbers congruent to 4 or 9 mod 13.A092464
Numbers congruent to 4 or 9 mod 13.
- a(n) = Sum_{i+j+k=n, 0<=j<=i<=n, 0<=k<=n} (n+k)!/(i! * j! * (2*k)!).A092465
a(n) = Sum_{i+j+k=n, 0<=j<=i<=n, 0<=k<=n} (n+k)!/(i! * j! * (2*k)!).
- a(n) = Sum_{i+j+k=n, 0<=j<=i<=k<=n} (n+k)!/(i! * j! * (2*k)!).A092466
a(n) = Sum_{i+j+k=n, 0<=j<=i<=k<=n} (n+k)!/(i! * j! * (2*k)!).
- a(n) = Sum_{i+j+k=n, 0<=i,j,k<=n} (n+2k)!/(i! * j! * (3*k)!).A092467
a(n) = Sum_{i+j+k=n, 0<=i,j,k<=n} (n+2k)!/(i! * j! * (3*k)!).
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2k)!/(i! * j! * (3*k)!).A092468
a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2k)!/(i! * j! * (3*k)!).
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2j)!/(i! * (3j)! * k!).A092469
a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2j)!/(i! * (3j)! * k!).
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2*i)!/((2*i)! * j! * k!).A092470
a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2*i)!/((2*i)! * j! * k!).
- a(n) = Sum_{i+j+k=n, 0<=i<=n, 0<=j<=n, 0<=k<=n} (n+i+j)!/((i+j)! * j! * k!).A092471
a(n) = Sum_{i+j+k=n, 0<=i<=n, 0<=j<=n, 0<=k<=n} (n+i+j)!/((i+j)! * j! * k!).
- a(n)=sum(i+j+k=n,(2n)!/(i+j)!/(j+k)!/(k+i)!) 0<=i<=n, 0<=j<=n, 0<=k<=n.A092472
a(n)=sum(i+j+k=n,(2n)!/(i+j)!/(j+k)!/(k+i)!) 0<=i<=n, 0<=j<=n, 0<=k<=n.
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (2n)!/((i+j)! * (j+k)! * (k+i)!).A092473
a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (2n)!/((i+j)! * (j+k)! * (k+i)!).
- a(n) is the first term in a sequence of primes such that a(n)+4m^2 is also prime for m = 1 to n.A092474
a(n) is the first term in a sequence of primes such that a(n)+4m^2 is also prime for m = 1 to n.
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.A092475
Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.
- Numbers that are congruent to {1, 3, 9} mod 13.A092476
Numbers that are congruent to {1, 3, 9} mod 13.
- Triangle read by rows: T(n,k) = (2^k - 1)^n, 1<=k<=n.A092477
Triangle read by rows: T(n,k) = (2^k - 1)^n, 1<=k<=n.
- Sequence of numbers graphed in stones at different floors of the windmill "Weltevreden" in Domburg (the Netherlands).A092478
Sequence of numbers graphed in stones at different floors of the windmill "Weltevreden" in Domburg (the Netherlands).
- T(n,k) is the number of numbers <= 2^n having exactly k prime factors (with repetitions), 0<=k<=n, triangle read by rows.A092479
T(n,k) is the number of numbers <= 2^n having exactly k prime factors (with repetitions), 0<=k<=n, triangle read by rows.
- Primes of the form 40*R_k + 7, where R_k is the repunit (A002275) of length k.A092480
Primes of the form 40*R_k + 7, where R_k is the repunit (A002275) of length k.
- Number of different sets of n-gons labeled 1...n such that all members of each set contain equivalent paths with increasing labels; i.e., the number of isotemporal classes of n-gons.A092481
Number of different sets of n-gons labeled 1...n such that all members of each set contain equivalent paths with increasing labels; i.e., the number of isotemporal classes of n-gons.
- Sequence contains no 3-term arithmetic progression, other than its initial terms 1, 2, 3.A092482
Sequence contains no 3-term arithmetic progression, other than its initial terms 1, 2, 3.
- a(n) is the floor of the average of the 1st moment of all previous entries.A092483
a(n) is the floor of the average of the 1st moment of all previous entries.
- Expansion of Product_{m>=1} (1 + m^2*q^m).A092484
Expansion of Product_{m>=1} (1 + m^2*q^m).
- Expansion of Product_{m>=1} (1+m*(m+1)*q^m).A092485
Expansion of Product_{m>=1} (1+m*(m+1)*q^m).
- Take natural numbers, exchange first and third quadrisection.A092486
Take natural numbers, exchange first and third quadrisection.
- a(n) = least k such that {n+1, n+2, n+3, ... n+k} has a subset the product of whose members with n is a square.A092487
a(n) = least k such that {n+1, n+2, n+3, ... n+k} has a subset the product of whose members with n is a square.
- a(n) = least k such that {n+0, n+1, n+2, n+3, ... n+k} has a nonempty subset the product of whose members is a square.A092488
a(n) = least k such that {n+0, n+1, n+2, n+3, ... n+k} has a nonempty subset the product of whose members is a square.
- Arises in enumeration of 321-hexagon-avoiding permutations.A092489
Arises in enumeration of 321-hexagon-avoiding permutations.
- a(n) = A058094(n) - 3*A058094(n-1) + A058094(n-2) for n >=4.A092490
a(n) = A058094(n) - 3*A058094(n-1) + A058094(n-2) for n >=4.
- a(n) = 2*A058094(n-2) - 5*A058094(n-3) + A058094(n-4) + a(n-1) for n >=4.A092491
a(n) = 2*A058094(n-2) - 5*A058094(n-3) + A058094(n-4) + a(n-1) for n >=4.
- Arises in enumeration of 321-hexagon-avoiding permutations.A092492
Arises in enumeration of 321-hexagon-avoiding permutations.
- a(n) = 4a(n-1) - 4a(n-2) + 3a(n-3) + a(n-4) - a(n-5).A092493
a(n) = 4a(n-1) - 4a(n-2) + 3a(n-3) + a(n-4) - a(n-5).
- a(n) = Sum_{p prime and p<=n} ceiling(n/p).A092494
a(n) = Sum_{p prime and p<=n} ceiling(n/p).
- Least factorial multiple of n.A092495
Least factorial multiple of n.
- Molien series for 16-dimensional group of structure S_3 and order 6, corresponding to complete weight enumerators of Hermitian self-dual GF(4)-linear codes over GF(16).A092496
Molien series for 16-dimensional group of structure S_3 and order 6, corresponding to complete weight enumerators of Hermitian self-dual GF(4)-linear codes over GF(16).
- Molien series for 16-dimensional group of structure Z_2^4.S_3 and order 96, corresponding to complete weight enumerators of Hermitian self-dual GF(4)-linear codes over GF(16) containing the all-ones vector.A092497
Molien series for 16-dimensional group of structure Z_2^4.S_3 and order 96, corresponding to complete weight enumerators of Hermitian self-dual GF(4)-linear codes over GF(16) containing the all-ones vector.
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^3*(1 - x^3)).A092498
Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^3*(1 - x^3)).
- Chebyshev polynomials S(n-1,21) with Diophantine property.A092499
Chebyshev polynomials S(n-1,21) with Diophantine property.
- a(0)=0; for n>0, a(n) = a(n-1)^2 + 10.A092500
a(0)=0; for n>0, a(n) = a(n-1)^2 + 10.
- a(0)=0, a(1)=1, a(2)=10; for n>2, a(n) = a(n-1)^2 + 10.A092501
a(0)=0, a(1)=1, a(2)=10; for n>2, a(n) = a(n-1)^2 + 10.
- First derivative of cyclotomic(n,x) evaluated at x=1.A092502
First derivative of cyclotomic(n,x) evaluated at x=1.
- a(n) = n^floor(n/2).A092503
a(n) = n^floor(n/2).
- a(n) = prime(n) + prime(n^2).A092504
a(n) = prime(n) + prime(n^2).
- a(n) = A002430(n) / A046990(n).A092505
a(n) = A002430(n) / A046990(n).
- Prime numbers of the form 2^n + 1.A092506
Prime numbers of the form 2^n + 1.
- (Smallest prime >= 2^n) + (largest prime <= 2^n).A092507
(Smallest prime >= 2^n) + (largest prime <= 2^n).
- G.f.: (1+x^18)/((1-x)*(1-x^4)*(1-x^8)*(1-x^12)).A092508
G.f.: (1+x^18)/((1-x)*(1-x^4)*(1-x^8)*(1-x^12)).
- Möbius transform of sequence A008475.A092509
Möbius transform of sequence A008475.
- Difference between smallest semiperimeter (see A063655) and its integer log (see A001414).A092510
Difference between smallest semiperimeter (see A063655) and its integer log (see A001414).