A145866 Number of representations of 2n as a sum of two terms of A145819.
1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 1, 1, 1, 2, 2, 3, 1, 3, 4, 3, 1, 2, 3, 2, 1, 1, 1, 1, 1, 2, 2, 3, 1, 3, 3, 2, 1, 3, 2, 5, 1, 3, 1, 1, 1, 2, 1
Offset: 1
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
A000695[n_]:= FromDigits[IntegerDigits[n,2], 4]; Table[(3+(-1)^n)*A000695[Floor[(2*n-2-(-1)^n)/4]] +4+(-1)^n , {n, 202}]//DeleteDuplicates//Sort (* G. C. Greubel, May 22 2023 *)
a147568(n) = 2*fromdigits(binary(n), 4) + 3;
lista(nn) = {my(v = vector(2*nn+2), ind = 0); for (n=0, nn, my(x = a147568(n)); v[ind++] = x; v[ind++] = 2*x - 1); vecsort(v,,8);} \\ Michel Marcus, Dec 18 2018
Comments