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, 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.

Links

Table of n, a(n) for n=1..100.

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

Cf. A117943, A255824 - A255829, A126616.

Sequence in context: A031219 A346689 A071498 * A339255 A086198 A086196

Adjacent sequences: A255822 A255823 A255824 * A255826 A255827 A255828

Keyword

nonn

Author

M. F. Hasler, Mar 07 2015

Status

approved