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!)
A066643 a(n) = floor(Pi*n^2). 10
3, 12, 28, 50, 78, 113, 153, 201, 254, 314, 380, 452, 530, 615, 706, 804, 907, 1017, 1134, 1256, 1385, 1520, 1661, 1809, 1963, 2123, 2290, 2463, 2642, 2827, 3019, 3216, 3421, 3631, 3848, 4071, 4300, 4536, 4778, 5026, 5281, 5541, 5808, 6082, 6361, 6647 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = floor(Pi*n^2).

MATHEMATICA

Table[ Floor[Pi*n^2], {n, 1, 50} ]

PROG

(PARI) { for (n=1, 1000, write("b066643.txt", n, " ", floor(Pi*n^2)) ) } \\ Harry J. Smith, Mar 15 2010

CROSSREFS

Sequence in context: A060781 A083539 A237426 * A140065 A115549 A005995

Adjacent sequences:  A066640 A066641 A066642 * A066644 A066645 A066646

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy, Dec 29 2001

EXTENSIONS

Corrected and extended by Robert G. Wilson v, Jan 03 2002

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 4 02:25 EST 2016. Contains 278745 sequences.