38272

Appears in sequences

• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=39A024689
• s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=38A025122
• Expansion of 1/(1 - 2*x^2 - 2*x^3).at n=20A052907
• Number of ways associated with A088959.at n=30A088111
• a(n)=4a(n-1)-4a(n-2)+4a(n-3).at n=10A099214
• Sum of divisors of A104365(n) = A104350(n) + 1.at n=9A104370
• Number of n X 2 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=6A183485
• Number of nX7 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=1A183490
• T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=29A183492
• T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=34A183492
• Number of 4-step self-avoiding walks on an n X n square summed over all starting positions.at n=33A188149
• The least n-almost Sophie Germain prime.at n=8A211169
• Number of circular permutations of the integers from 0 to n which generate a complete stepping-on sequence, when the stepping-on direction depends on the odd/even parity of the current value.at n=11A322253