login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057828 Number of perfect squares, k^2, where k^2 <= n and GCD(k,n) = 1. 2
1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 3, 2, 2, 2, 4, 1, 4, 2, 3, 2, 4, 1, 4, 3, 4, 3, 5, 1, 5, 3, 4, 3, 4, 2, 6, 3, 4, 2, 6, 2, 6, 3, 3, 3, 6, 2, 6, 3, 5, 4, 7, 3, 6, 3, 5, 4, 7, 2, 7, 4, 4, 4, 7, 3, 8, 4, 6, 2, 8, 3, 8, 4, 5, 4, 7, 3, 8, 3, 6, 5, 9, 2, 8, 5, 6, 5, 9, 2, 8, 5, 6, 5, 8, 3, 9, 4, 6, 4, 10, 3, 10, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

Only 2 squares, 1 and 9, are <= 14 and relatively prime to 14. So a(14) = 2.

PROG

(Haskell)

a057828 x = length $ filter ((== 1) . (gcd x)) $

                     takeWhile (<= x) $ tail a000290_list

-- Reinhard Zumkeller, Jul 22 2012

CROSSREFS

Cf. A000290, A010051.

Sequence in context: A124830 A191373 A026904 * A082498 A112223 A178771

Adjacent sequences:  A057825 A057826 A057827 * A057829 A057830 A057831

KEYWORD

nonn,look

AUTHOR

Leroy Quet, Nov 08 2000

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 21:03 EST 2016. Contains 278952 sequences.