Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132851 a(0)=1. a(n) = the largest squarefree integer which divides (n+a(n-1)), for n>=1. +0
1
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; listen)
OFFSET

0,2

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 (stefan.steinerberger(AT)gmail.com), Dec 19 2007

CROSSREFS

Cf. A007947.

Sequence in context: A135376 A132850 A076561 this_sequence A146316 A128134 A130327

Adjacent sequences: A132848 A132849 A132850 this_sequence A132852 A132853 A132854

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Nov 21 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 19 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research