

A104647


a(n) = a(n1) mod n + a(n2) mod n; a(0) = 0, a(1) = 1.


9



0, 1, 1, 2, 3, 5, 8, 6, 6, 12, 8, 9, 17, 13, 16, 14, 14, 28, 24, 14, 18, 32, 28, 14, 18, 32, 24, 29, 25, 25, 50, 44, 30, 41, 37, 8, 9, 17, 26, 43, 29, 31, 60, 48, 20, 23, 43, 66, 61, 29, 40, 69, 57, 20, 23, 43, 66, 52, 60, 53, 53, 106, 97, 77, 46, 58, 104, 95, 63, 89, 82, 29, 39, 68
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

a(n) <= a(n1) + a(n2) < 2*n for n>0, see A105859 for numbers i such that a(i)=a(i1)+a(i2) and A105860 for numbers j with a(j)<a(j1)+a(j2);  Reinhard Zumkeller, Apr 23 2005


LINKS



MATHEMATICA

Fold[Append[#1, Mod[#1[[1]], #2] + Mod[#1[[2]], #2]] &, {0, 1}, Range[2, 73]] (* Ivan Neretin, Jun 18 2018 *)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



