

A134835


Let {b_n(m)} be a sequence defined by b_n(0)=0, b_n(m) = the largest prime dividing (b_n(m1) +n). Then a(n) is the smallest positive integer such that b_n(m+a(n)) = b_n(m), for all integers m that are greater than some positive integer M.


1



1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 6, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,3


LINKS

Table of n, a(n) for n=2..13.


EXAMPLE

Sequence {b_8(m)} is 0,2,5,13,7,5,13,7,...(5,13,7) repeats. So a(8) = 3, the length of the cycle in {b_8(m)}.


CROSSREFS

Cf. A134834.
Sequence in context: A128211 A199393 A010327 * A321592 A031278 A010328
Adjacent sequences: A134832 A134833 A134834 * A134836 A134837 A134838


KEYWORD

more,nonn


AUTHOR

Leroy Quet, Nov 12 2007


STATUS

approved



