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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066643 a(n) = floor(Pi*n^2). 12
 0, 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 0,2 LINKS Harry J. Smith, Table of n, a(n) for n = 0..1000 FORMULA a(n) = floor(Pi*n^2). a(n) = A022844(n^2) . - R. J. Mathar, Jan 25 2023 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 Cf. A338020 (first differences). Sequence in context: A060781 A083539 A237426 * A140065 A294418 A308669 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 19 08:08 EDT 2024. Contains 371782 sequences. (Running on oeis4.)