login
A255825
A self-generating sequence: a(n) = n for n < 5; a(5n) = a(n); if every 5th term (a(5), a(10), a(15),...) is deleted, this gives back the original sequence.
1
1, 2, 3, 4, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 4, 2, 3, 1, 4, 1, 2, 3, 1, 4, 1, 1, 2, 3, 1, 1, 4, 1, 1, 2, 1, 3, 1, 1, 4, 1, 1, 1, 2, 1, 2, 3, 1, 1, 4, 1, 1, 1, 1, 2, 2, 1, 2, 3, 1, 1, 1, 4, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 3, 1, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 4
OFFSET
1,2
COMMENTS
This is the m=5 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/5) if n==0 (mod 5); a(n) = a(n - floor(n/5)) otherwise.
PROG
(PARI) a(n, m=5)=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