login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A140192
Same as A140191 except here e=5.
2
1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 4, 1, 1, 1, 1, 2, 3, 2, 3, 1, 2, 2, 3, 2, 4, 4, 7, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 3, 4, 2, 4, 3, 7, 1, 1, 2, 3, 2, 3, 3, 6, 2, 3, 4, 6, 4, 7, 7, 13, 1, 2, 1, 2, 1, 3, 2, 4, 1, 2, 2, 4, 1, 3, 3, 7, 2, 3, 2, 3, 3, 6, 4, 7, 2, 4, 4, 7, 3, 7, 7, 14, 1, 2, 1, 3, 2, 4, 3, 6, 2
OFFSET
0,6
LINKS
Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..3000
PROG
See link in A140191 for Fortran program.
CROSSREFS
Sequence in context: A039736 A093921 A353426 * A324905 A240231 A366075
KEYWORD
nonn
AUTHOR
STATUS
approved