|
| |
|
|
A140978
|
|
Repeat (n+1)^2 n times.
|
|
3
| |
|
|
4, 9, 9, 16, 16, 16, 25, 25, 25, 25, 36, 36, 36, 36, 36, 49, 49, 49, 49, 49, 49, 64, 64, 64, 64, 64, 64, 64, 81, 81, 81, 81, 81, 81, 81, 81, 100, 100, 100, 100, 100, 100, 100, 100, 100, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| See A093995.
Frenicle writes the entries in the form a(n) = A055096(n)-A133819(n), with the flattened index view of A133819: 4=5-1, 9=10-1, 9=13-4, 16=17-1, 16=20-4, 16=25-9 etc.
|
|
|
LINKS
| M. de Frenicle, Methode pour trouver la solutions des problems par les exclusions, in: Divers ouvrage des mathematique et de physique par messieurs de l'academie royale des science, (1693) pp 1-44, table page 11.
|
|
|
FORMULA
| a(n)=(A003057(n+1))^2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 25 2008
|
|
|
CROSSREFS
| Sequence in context: A157300 A100555 A186887 * A106410 A065737 A014719
Adjacent sequences: A140975 A140976 A140977 * A140979 A140980 A140981
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Aug 17 2008
|
| |
|
|
