|
Search: id:A110809
|
|
|
| A110809 |
|
a(1) = 3, a(2n) = a(2n-1)*(a(2n-1)+1)/2, a(2n+1) = a(2n)*(a(2n)-1)/2. |
|
+0
1
|
|
| 3, 6, 15, 120, 7140, 25493370, 324955944231765, 52798182845779144865989623495, 1393824055908163580110066696496417846029512708072933195765, 971372749414141756744711053350258180262238679505115309556108472465628097348257583700704919225793663496284373565495
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(10) has 114 digits; a(11) has 228 digits. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 06 2005
|
|
MAPLE
|
a:=proc(n) if n=1 then 3 elif n mod 2 = 0 then a(n-1)*(a(n-1)+1)/2 else a(n-1)*(a(n-1)-1)/2 fi end: seq(a(n), n=1..10); (Deutsch)
|
|
CROSSREFS
|
Adjacent sequences: A110806 A110807 A110808 this_sequence A110810 A110811 A110812
Sequence in context: A013277 A013270 A013276 this_sequence A013275 A013271 A013272
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 14 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 06 2005
|
|
|
Search completed in 0.002 seconds
|
