|
Search: id:A059993
|
|
|
| A059993 |
|
Pinwheel numbers: 2n^2 + 6n + 1. |
|
+0
2
|
|
| 1, 9, 21, 37, 57, 81, 109, 141, 177, 217, 261, 309, 361, 417, 477, 541, 609, 681, 757, 837, 921, 1009, 1101, 1197, 1297, 1401, 1509, 1621, 1737, 1857, 1981, 2109, 2241, 2377, 2517, 2661, 2809, 2961, 3117, 3277, 3441, 3609, 3781, 3957, 4137, 4321, 4509
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
figure
|
|
FORMULA
|
a(n)=a(n-1)+4n (with a(1)=1) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 08 2009]
|
|
EXAMPLE
|
For n=2, a(2)=1+8=9; n=3, a(3)=9+12=21; n=4, a(4)=21+16=37 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 08 2009]
|
|
MATHEMATICA
|
a=-3; lst={}; Do[a+=n; AppendTo[lst, a], {n, 0, 6!, 4}]; lst...and/or... lst={}; Do[AppendTo[lst, 2*n^2+6*n+1], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 01 2009]
1. Table[2*n^2 + 6*n + 1, {n, 0, 46}] (.) 2. lst = {}; Do[a = 2*n^2 + 6*n + 1; AppendTo[lst, a], {n, 0, 46}]; lst (.) [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 10 2009]
|
|
PROGRAM
|
(PARI) { for (n=0, 1000, write("b059993.txt", n, " ", 2*n^2 + 6*n + 1); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 01 2009]
|
|
CROSSREFS
|
Sequence in context: A043892 A146069 A140673 this_sequence A036704 A107890 A110209
Adjacent sequences: A059990 A059991 A059992 this_sequence A059994 A059995 A059996
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Naohiro Nomoto (6284968128(AT)geocities.co.jp), Mar 14 2001
|
|
|
Search completed in 0.002 seconds
|
