login
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
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
KEYWORD
nonn
AUTHOR
John W. Layman, Apr 27 2007
STATUS
approved