26463

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 = (1, p(1), p(2), ...), t = (composite numbers).at n=41A024480
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=40A025100
• "BIJ" (reversible, indistinct, labeled) transform of 3,3,3,3...at n=4A032113
• Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=31A096024
• Number of nX3 1..5 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=3A166803
• Number of 4 X n 0..1 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=15A223951
• Number of partitions n such that the multiplicity of the number of odd parts is a part.at n=47A240541
• The internal state of the Sinclair ZX81 and Spectrum random number generator.at n=7A357907