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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054253 a(n) = n + max{ a(i)*a(n-i) ; 1 <= i <= n-1 }, a(n) = n for n <= 2. 1
1, 2, 5, 9, 15, 31, 52, 89, 164, 289, 479, 973, 1625, 2773, 5099, 8975, 15045, 30181, 50615, 86617, 159593, 281219, 469648, 946753, 1581150, 2698155, 4961354, 8732703, 14638814, 29366143, 49248426, 84278373, 155284022 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..33.

EXAMPLE

a(5) = 5 plus the maximum of {1*2,2*5} = 5+10=15.

a(6) = 6 plus the maximum of {1*15,2*9,5*5} = 6+25=31.

MAPLE

A054253 := proc(n) local i, j; option remember; if n<=2 then n else j := 0; for i from 1 to n-1 do if procname(i)*procname(n-i) >= j then j := procname(i)*procname(n-i); end if; end do; n+j; end if; end proc;

CROSSREFS

Sequence in context: A267757 A176691 A274355 * A045649 A267694 A024519

Adjacent sequences:  A054250 A054251 A054252 * A054254 A054255 A054256

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 04 2000

EXTENSIONS

More specific name and examples from M. F. Hasler, Dec 08 2009 and R. J. Mathar, Dec 09 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 23 02:46 EDT 2017. Contains 286909 sequences.