login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129382 a(0)=1. a(n) = the number of earlier terms which are coprime to floor(sqrt(n)). 1
1, 1, 2, 3, 3, 4, 4, 4, 4, 7, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 16, 17, 18, 19, 20, 20, 20, 20, 20, 20, 20, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
Floor(sqrt(11)) = 3. So a(11) is the number of terms from among a(0),a(1),...a(10) which are coprime to 3. Every term from a(0) through a(10), with the exception of a(3) and a(4), is coprime to 3; so a(11) = 9.
MAPLE
a[0]:=1: for n from 1 to 100 do ct:=0: for j from 0 to n-1 do if igcd(a[j], floor(sqrt(n)))=1 then ct:=ct+1 else fi: od: a[n]:=ct: od: seq(a[n], n=0..100); # Emeric Deutsch, Apr 16 2007
CROSSREFS
Cf. A129381.
Sequence in context: A357815 A221983 A029118 * A353241 A163515 A220348
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 12 2007
EXTENSIONS
More terms from Emeric Deutsch, Apr 16 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)