login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091980 Recursive sequence; one more than maximum of products of pairs of previous terms with indices summing to current index. 0
1, 2, 3, 5, 7, 11, 16, 26, 36, 56, 81, 131, 183, 287, 417, 677, 937, 1457, 2107, 3407, 4759, 7463, 10843, 17603, 24373, 37913, 54838, 88688, 123892, 194300, 282310, 458330, 634350, 986390, 1426440, 2306540, 3221844, 5052452, 7340712, 11917232 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

It appears that the maximum is always obtained by taking i as the power of 2 nearest to n/2. A proof would be nice.

FORMULA

a_n = max_{i=1}^{n-1} a_i*a_{n-i} + 1.

CROSSREFS

Sequence in context: A154888 A018057 A130137 * A005685 A141656 A092180

Adjacent sequences:  A091977 A091978 A091979 * A091981 A091982 A091983

KEYWORD

easy,nonn

AUTHOR

Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 15 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.