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

Links

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

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

Cf. A117943, A255824 - A255829, A126616.

Sequence in context: A030548 A346690 A117724 * A339256 A277544 A190595

Adjacent sequences: A255823 A255824 A255825 * A255827 A255828 A255829

Keyword

nonn

Author

M. F. Hasler, Mar 07 2015

Status

approved