Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122961 Alternately form product and sum of all previous terms. +0
1
1, 1, 1, 3, 3, 9, 81, 99, 649539, 649737, 274124633198656977, 274124633199956451, 20598907656583661830059012023854018733151994905840579, 20598907656583661830059012023854019281401261305753481 (list; graph; listen)
OFFSET

1,4

COMMENT

Note that definition does not make a(1) a special case; it is the empty product, which is 1. If we started with addition, the sequence would be all zeros.

FORMULA

a(1) = a(2) = 1. For n > 1, a(2n-1) = a(2n-3)^2 * a(2n-2), a(2n) = 2 * a(2n-2) + a(2n-1).

CROSSREFS

Cf. A039941, A000004.

Sequence in context: A100239 A038080 A115564 this_sequence A165421 A100731 A072004

Adjacent sequences: A122958 A122959 A122960 this_sequence A122962 A122963 A122964

KEYWORD

nonn

AUTHOR

Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 26 2006

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research