|
|
A255824
|
|
a(n) = n for n < 4; a(4n) = a(n); if every 4th term (a(4), a(8), a(12), ...) is deleted, this gives back the original sequence.
|
|
7
|
|
|
1, 2, 3, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 3, 1, 2, 1, 3, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 1, 1, 3, 1, 2, 1, 2, 2, 1, 2, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 3, 3, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A self-generating sequence. This is the m=4 analog of the m=10 variant A126616. Sequence A117943 is the m=3 analog with all terms decreased by 1.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n/4) if n == 0 (mod 4); a(n) = a(n - floor(n/4)) otherwise.
|
|
PROG
|
(PARI) a(n, m=4)=while(n>=m, if(n%m, n-=n\m, n\=m)); n \\ M. F. Hasler, Mar 07 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|