|
Search: id:A151611
|
|
|
| A151611 |
|
a(1) = 4; for n >= 1, a(n+1) = 4 + binomial(a(n), 2). |
|
+0
1
|
|
| 4, 10, 49, 1180, 695614, 241939070695, 29267256964259134356169, 428286165105987400438217763289707431507000200
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Arises in a geometry problem: see link.
Next term (a(9)) has 89 digits. [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2009]
|
|
LINKS
|
Antreas P. Hatzipolakis, Concurrent NPC's
|
|
MAPLE
|
a[1] := 4: for n to 7 do a[n+1] := 4+binomial(a[n], 2) end do: seq(a[n], n = 1 .. 8); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2009]
|
|
CROSSREFS
|
Sequence in context: A099606 A149231 A081565 this_sequence A032495 A109387 A018844
Adjacent sequences: A151608 A151609 A151610 this_sequence A151612 A151613 A151614
|
|
KEYWORD
|
nonn,easy,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 28 2009
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2009
|
|
|
Search completed in 0.002 seconds
|
