cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A128939 Maximal product over partitions of n into parts of the form 3k+1.

Original entry on oeis.org

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

Views

Author

John W. Layman, Apr 27 2007

Keywords

Crossrefs

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.)