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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128939 Maximal product over partitions of n into parts of the form 3k+1. 0
1, 1, 1, 4, 4, 4, 7, 16, 16, 16, 28, 64, 64, 64, 112, 256, 256, 256, 448, 1024, 1024, 1024, 1792, 4096, 4096, 4096, 7168, 16384, 16384, 16384, 28672, 65536, 65536, 65536, 114688, 262144, 262144, 262144, 458752, 1048576 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

Conjecture. a(n)=1 if n<4, else a(n)=4^[n/4] if n<>4m+3, else a(n)=7*4^([n/4]-1), where [...] denotes the Floor function. (This has been verified up to n=40.)

CROSSREFS

Cf. A000792, A034893, A094958.

Sequence in context: A023958 A137751 A010658 * A105352 A132200 A110757

Adjacent sequences:  A128936 A128937 A128938 * A128940 A128941 A128942

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Apr 27 2007

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 14 18:47 EST 2012. Contains 205663 sequences.