269392

Appears in sequences

• Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.at n=39A074483
• Coefficient of x^n in the series 1/F(-1/2,1/2;1;16x), where F(a1,a2;b;x) is the hypergeometric series.at n=6A188266