A107261
Number of a(i), 0<=iA053615(n).
0, 0, 2, 0, 1, 1, 3, 2, 2, 1, 3, 3, 3, 3, 3, 6, 0, 6, 3, 3, 4, 3, 3, 10, 1, 0, 1, 10, 3, 5, 5, 5, 3, 12, 1, 3, 2, 3, 1, 14, 4, 7, 5, 7, 4, 14, 3, 4, 2, 2, 2, 4, 5, 15, 7, 7, 5, 7, 7, 15, 5, 7, 2, 7, 0, 8, 2, 7, 5, 15, 9, 7, 6, 7, 9, 15, 5, 9, 3, 11, 1, 3, 1, 11, 3, 9, 5, 18, 9, 9, 6, 9, 9, 18, 5
Offset: 0
Keywords
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..10000
Programs
-
PARI
\\ here b(n)=A053615(n) b(n)={my(t=(sqrtint(4*n) + 1)\2); t-abs(t^2-n)} seq(n)={my(f=vector(sqrtint(n)+1), a=vector(n+1)); for(i=0, n, my(k=f[1+b(i)]); a[1+i]=k; if(k<#f, f[1+k]++)); a} \\ Andrew Howroyd, Nov 12 2024