login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110809 a(1) = 3, a(2n) = a(2n-1)*(a(2n-1)+1)/2, a(2n+1) = a(2n)*(a(2n)-1)/2. 0
3, 6, 15, 120, 7140, 25493370, 324955944231765, 52798182845779144865989623495, 1393824055908163580110066696496417846029512708072933195765, 971372749414141756744711053350258180262238679505115309556108472465628097348257583700704919225793663496284373565495 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(10) has 114 digits; a(11) has 228 digits. - Emeric Deutsch, Oct 06 2005
LINKS
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); # Emeric Deutsch, Oct 06 2005
CROSSREFS
Sequence in context: A280992 A013270 A013276 * A013275 A013271 A013272
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Aug 14 2005
EXTENSIONS
More terms from Emeric Deutsch, Oct 06 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)