Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039941
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039941 Alternately add and multiply. +0
6
0, 1, 1, 1, 2, 2, 4, 8, 12, 96, 108, 10368, 10476, 108615168, 108625644, 11798392572168192, 11798392680793836, 139202068568601556987554268864512, 139202068568601568785946949658348 (list; graph; listen)
OFFSET

0,5

LINKS

A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.

FORMULA

a(2n) = a(2n-1) + a(2n-2); a(2n+1) = a(2n-1)*a(2n); a(0) = 0; a(1) = 1

a(n)={a(n-1)+a(n-2), n even, a(n-1)*a(n-2), n odd}. a(0)=0. a(1)=1.

PROGRAM

(PARI) a(n)=if(n<2, n>0, if(n%2, a(n-1)*a(n-2), a(n-1)+a(n-2)))

CROSSREFS

A001696(n)=A039941(2*n), A001697(n)=A039941(2*n+1).

Sequence in context: A153996 A123024 A079092 this_sequence A104700 A036761 A042979

Adjacent sequences: A039938 A039939 A039940 this_sequence A039942 A039943 A039944

KEYWORD

easy,nonn,nice

AUTHOR

Walter G. Carlini (541carlini(AT)charter.net)

EXTENSIONS

Additional comments from Michael Somos, May 19, 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research