29776

Appears in sequences

• Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=39A036009
• Expansion of 1 / Product_{k>=1} (1-x^k-x^(2*k)).at n=19A162891
• The right-hand half-triangle of A185356 (or A202690).at n=30A202815
• Number of defective 4-colorings of an n X n 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=4A229748
• Number of defective 4-colorings of an n X 5 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=4A229752
• T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=40A229755
• Irregular triangle T(n,k) of Arnold numbers with n>=1 and 1<= abs(k) <= n.at n=66A335335
• a(n) = Sum_{k=0..n} binomial(n,k) * binomial(3*n+4*k,k).at n=4A388728
• Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details).at n=47A390939
• Value of T[2] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[2] isn't defined yet.at n=19A390942