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”).

A140193
Same as A140191 except here e=6.
1
1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 2, 2, 1, 1, 3, 3, 2, 2, 3, 3, 3, 3, 6, 6, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 2, 2, 3, 3, 5, 5, 2, 2, 3, 3, 3, 3, 6, 6, 3, 3, 5, 5, 6, 6, 11, 11, 1, 1, 2, 2, 1, 1, 3, 3, 2, 2, 3, 3, 3, 3, 6, 6, 1, 1, 3, 3, 2, 2, 5, 5, 3, 3, 6, 6, 5, 5, 11, 11, 2, 2, 3, 3, 3, 3, 6
OFFSET
0,7
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: A227153 A328581 A238643 * A073741 A071838 A157896
KEYWORD
nonn
AUTHOR
STATUS
approved