login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132851 a(0)=1. a(n) = the largest squarefree integer which divides (n+a(n-1)), for n>=1. 0
1, 2, 2, 5, 3, 2, 2, 3, 11, 10, 10, 21, 33, 46, 30, 15, 31, 6, 6, 5, 5, 26, 6, 29, 53, 78, 26, 53, 3, 2, 2, 33, 65, 14, 6, 41, 77, 114, 38, 77, 39, 10, 26, 69, 113, 158, 102, 149, 197, 246, 74, 5, 57, 110, 82, 137, 193, 10, 34, 93, 51, 14, 38, 101, 165, 230, 74, 141, 209, 278 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..69.

EXAMPLE

a(8) + 9 = 11 + 9 = 20. 20 = 2^2 *5, so the largest squarefree divisor of 20 is 2*5 = 10. a(9) is therefore 10.

MATHEMATICA

a[n_] := If[Max[Table[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}]] > 1, 0, 1]; b = {1}; Do[AppendTo[b, Select[Divisors[j + b[[ -1]]], a[ # ] == 1 &][[ -1]]], {j, 1, 100}]; b (* Stefan Steinerberger, Dec 19 2007 *)

CROSSREFS

Cf. A007947.

Sequence in context: A135376 A132850 A076561 * A293833 A146316 A258803

Adjacent sequences:  A132848 A132849 A132850 * A132852 A132853 A132854

KEYWORD

nonn

AUTHOR

Leroy Quet, Nov 21 2007

EXTENSIONS

More terms from Stefan Steinerberger, Dec 19 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 06:59 EST 2020. Contains 332299 sequences. (Running on oeis4.)