Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072909 Least k>0 such that n+k is squarefree. +0
1
1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 4, 3, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 1, 1, 2, 1, 1 (list; graph; listen)
OFFSET

1,3

FORMULA

It seems that sum(k=1, n, a(k) ) is asymptotic to C*n with C=1.5...

PROGRAM

(PARI) a(n)=if(n<0, 0, s=1; while(issquarefree(n+s)==0, s++); s)

CROSSREFS

Sequence in context: A096669 A096591 A115568 this_sequence A095691 A067029 A087179

Adjacent sequences: A072906 A072907 A072908 this_sequence A072910 A072911 A072912

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 10 2002

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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research