A338493 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A338493

Least number of square pyramidal numbers needed to represent n.

4

1, 2, 3, 4, 1, 2, 3, 4, 5, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 3, 4, 5, 6, 2, 3, 1, 2, 3, 3, 4, 2, 3, 4, 4, 5, 3, 4, 3, 4, 2, 3, 4, 4, 5, 3, 4, 5, 5, 6, 4, 1, 2, 3, 3, 4, 2, 3, 4, 4, 5, 3, 4, 5, 5, 2, 3, 4, 4, 5, 3, 4, 5, 5, 6, 4, 5, 6, 6, 3, 4, 2, 3, 4, 4, 5, 3, 1, 2, 3, 4, 4, 2, 3, 4, 3, 4, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

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

Eric Weisstein's World of Mathematics, Square Pyramidal Number

Index to sequences related to pyramidal numbers

CROSSREFS

Cf. A000330, A002828, A104246, A338484, A338494, A338495.

Sequence in context: A100878 A145172 A338484 * A280053 A283365 A053824

Adjacent sequences: A338490 A338491 A338492 * A338494 A338495 A338496

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Oct 30 2020

STATUS

approved