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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338496 Least number of octagonal pyramidal numbers needed to represent n. 1
1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 4, 5, 6, 7, 8, 9, 10, 3, 4, 5, 1, 2, 3, 4, 5, 6, 4, 5, 6, 2, 3, 4, 5, 6, 7, 5, 6, 7, 3, 4, 5, 6, 7, 8, 6, 7, 8, 4, 5, 6, 2, 3, 4, 5, 6, 7, 5, 6, 7, 3, 1, 2, 3, 4, 5, 6, 7, 8, 4, 2, 3, 4, 5, 6, 7, 8, 9, 5, 3, 4, 3, 4, 5, 6, 7, 8, 6, 4, 5, 4, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Pyramidal Number
CROSSREFS
Sequence in context: A053844 A010887 A101412 * A053830 A033929 A025482
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 31 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)