|
Search: id:A061266
|
|
|
| A061266 |
|
Number of squares between consecutive cubes. |
|
+0
1
|
|
| 1, 3, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 5, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 8, 9, 9, 8, 9, 9, 9, 9, 10, 10, 9, 10, 10, 10, 11, 10, 10, 10, 11, 10, 11, 11, 11, 12, 11, 11, 12, 11, 12, 12, 12, 11, 12, 12, 12, 12, 13, 12, 13, 12, 13, 13, 13, 13, 13, 13, 14, 13, 13, 13, 14
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,2000
|
|
FORMULA
|
3 if n==2, [sqrt(n+1)^3-1]-[sqrt((n+1)^3+1] else. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 28 2003
|
|
EXAMPLE
|
a(2)= 3 as there are three squares 9,16 and 25 between 8 and 27. a(3)= 2 as there are two squares 36 and 49 between 27 and 64. ( 64 is not to be counted.)
|
|
PROGRAM
|
(PARI) print1("1, 3, "):for(n=3, 100, print1(sqrtint((n+1)^3-1)-sqrtint(n^3+1)", "))
(PARI) { for (n=1, 2000, a=sqrtint((n+1)^3-1)-sqrtint(n^3+1); if (n==2, a=3); write("b061266.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 20 2009]
|
|
CROSSREFS
|
Sequence in context: A144733 A091460 A035093 this_sequence A111114 A125748 A058680
Adjacent sequences: A061263 A061264 A061265 this_sequence A061267 A061268 A061269
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 24 2001
|
|
EXTENSIONS
|
More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 28 2003
OFFSET changed from 0,2 to 1,2 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 20 2009
|
|
|
Search completed in 0.002 seconds
|
