73191
domain: N
Appears in sequences
- Number of strictly increasing addition chains of length n.at n=8A008933
- Duplicate of A008933.at n=8A010787
- 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 x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.at n=40A074482
- a(n) = index of first appearance of n in A096859.at n=20A097007
- a(n) = (4*n^3 - 12*n^2 + 14*n + 3)/3.at n=39A161703