71940

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).at n=29A024593
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=28A025107
• a(n) = T(n,[ n/2 ]), where T is the array in A026323.at n=15A026336
• a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=33A124350
• Even heptagonal pyramidal numbers.at n=32A218325
• Number of n-bead ternary necklaces (no turning over allowed) that avoid the subsequence 110.at n=13A274018
• Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.at n=7A385340