58717
domain: N
Appears in sequences
- If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=41A104205
- a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a triangular number.at n=44A214961
- Expansion of e.g.f. exp( (exp(x^2) - 1)/x ).at n=9A357962