120750

Appears in sequences

• Number of 4-ary rooted trees with n nodes and height exactly 7.at n=17A036631
• Number of n-bead necklaces with exactly three different colored beads.at n=12A056283
• Number of primitive (period n) n-bead necklaces with exactly three different colored beads.at n=12A056288
• a(n) is the (1,2)-entry of the n-th power of the 2 X 2 matrix [0,1;n-1,2(n-1)].at n=5A109517
• a(n) = 10*a(n-1) + 5*a(n-2), with a(0)=0, a(1)=1.at n=6A190955
• Number of nX3 0..4 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=4A201341
• Number of nX5 0..4 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=2A201343
• T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=23A201345
• T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=25A201345
• The hyper-Wiener index of the triangular graph T(n) (n >= 1).at n=24A228317
• The hyper-Wiener index of the Fibonacci cube Gamma(n) (n>=1).at n=9A246175
• a(n) = largest k such that A049820(k) <= A262509(n).at n=15A263083
• a(n) = 3*(9*n - 1)*(3*n - 2).at n=39A277985
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2*k*x - k*x^2).at n=60A342134