login
A255826
a(n) = n for n < 6; a(6n) = a(n); if every 6th term (a(6), a(12), a(18),...) is deleted, this gives back the original sequence.
1
1, 2, 3, 4, 5, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 1, 4, 3, 2, 1, 4, 3, 5, 2, 1, 4, 3, 5, 1, 2, 1, 4, 3, 5, 1, 1, 2, 1, 4, 3, 1, 5, 1, 1, 2, 1, 1, 4, 3, 1, 5, 1, 1, 1, 2, 1, 1, 4, 1, 3, 1, 5, 1, 1, 2, 1, 2, 1, 1, 4, 1, 1, 3, 1, 5, 1, 2, 1, 2, 1, 2, 1, 1, 1, 4, 1, 1, 3, 2, 1, 5, 1, 2
OFFSET
1,2
COMMENTS
A self-generating sequence. This is the m=6 analog of the m=10 variant A126616. Sequence A117943 is the m=3 analog with all terms decreased by 1.
FORMULA
a(n) = a(n/6) if n==0 (mod 6); a(n) = a(n - floor(n/6)) otherwise.
PROG
(PARI) a(n, m=6)=while(n>=m, if(n%m, n-=n\m, n\=m)); n \\ M. F. Hasler, Mar 07 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Mar 07 2015
STATUS
approved