29190

Appears in sequences

• Number of partitions with no even part repeated; partitions of n in which no parts are multiples of 4.at n=46A001935
• Hexagonal pyramidal numbers, or greengrocer's numbers.at n=35A002412
• Even hexagonal pyramidal numbers.at n=16A015226
• Number of partitions of 2n in which no parts are multiples of 4.at n=23A081055
• Expansion of psi(x) / phi(x) in powers of x where phi(), psi() are Ramanujan theta functions.at n=46A083365
• Triangle U, read by rows, where column k of U^(j+1) = column j of P^(3k+1) for j>=0, k>=0 and P=A136220.at n=31A136228
• Numbers k with equal remainders of (product of divisors of k) mod (sum of divisors of k) and (product of proper divisors of k) mod (sum of proper divisors of k).at n=42A192035
• Places n such that the two remainders A187680(n) and A191906(n) are both zero.at n=17A192853
• Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,0,1 for x=0,1,2,3,4.at n=5A197675
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,0,1 for x=0,1,2,3,4.at n=3A197677
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,0,1 for x=0,1,2,3,4.at n=39A197679
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,0,1 for x=0,1,2,3,4.at n=41A197679
• Expansion of phi(-x^3) * psi(-x^3) / phi(-x)^2 in powers of x where phi(), psi() are Ramanujan theta functions.at n=15A260546
• Let s(k) denote the sum of the even proper divisors of k. The sequence lists the pairs of numbers (x, y) such that s(x) = y and s(y) = x.at n=13A279812
• List of ordered pairs (x, y) from A279812.at n=13A279950
• Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.at n=19A328762
• Triangle read by rows: T(n,m)= Sum_{k=0..m/2} C(n-k,m-2*k)*C(n-k,m-k)*C(n,k)/C(2*k,k).at n=51A338397
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=25A338474
• Expansion of g.f. A(x) = Sum_{n>=0} d^n/dx^n x^(2*n) * (1 + x)^(3*n) / n!.at n=6A361303
• Number of distinct n X n patterns in the squiral tiling.at n=42A375874