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.

Showing 1-4 of 4 results.

A338494 Least number of pentagonal pyramidal numbers needed to represent n.

Original entry on oeis.org

1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 3, 4, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 8, 4, 5, 4, 5, 6, 1, 2, 3, 4, 5, 2, 2, 3, 4, 5, 6, 3, 3, 4, 5, 5, 6, 4, 2, 3, 4, 5, 6, 3, 3, 4, 5
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 30 2020

Keywords

Links

Crossrefs

Cf. A002411, A100878, A104246, A338491, A338493, A338495.

A338495 Least number of hexagonal pyramidal numbers needed to represent n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 7, 8, 3, 1, 2, 3, 4, 5, 6, 4, 2, 3, 4, 5, 6, 7, 5, 3, 4, 5, 6, 7, 8, 6, 4, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 7, 8, 3, 4, 3, 4, 5, 6, 7, 4, 2, 3, 4, 5, 6, 7, 5, 3, 4, 5, 6, 7, 8, 6, 4, 5, 4, 5, 6, 7, 7, 5, 3, 1, 2, 3, 4, 5, 2, 3
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 30 2020

Keywords

Links

Crossrefs

Cf. A002412, A104246, A234533, A338479, A338493, A338494.

Programs

  • Maple
    N:= 200: # for a(1)..a(N)
V:= Vector(N):
S:= {seq(n*(n+1)*(4*n-1)/6,n=1..floor((N*3/2)^(1/3)))}:
V[convert(S,list)]:= 1:
T:= S:
for m from 2 do
  Tn:= select(`<=`,map(t -> op(t +~ S),T),N) minus T;
  if nops(Tn) = 0 then break fi;
  T:= T union Tn;
  V[convert(Tn,list)]:= m
od:
convert(V,list); # Robert Israel, Nov 02 2020

A338458 Least number of heptagonal pyramidal numbers needed to represent n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 1, 2, 3, 4, 5, 6, 4, 5, 2, 3, 4, 5, 6, 7, 5, 6, 3, 4, 5, 6, 7, 8, 6, 7, 4, 5, 2, 3, 4, 5, 6, 7, 5, 6, 1, 2, 3, 4, 5, 6, 6, 7, 2, 3, 4, 5, 6, 7, 7, 8, 3, 4, 3, 4, 5, 6, 7, 8, 4, 5, 2, 3, 4, 5, 6, 7, 5, 6, 3, 4, 5, 6, 7, 8, 6, 7
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 31 2020

Keywords

Links

Crossrefs

Cf. A002413, A104246, A338480, A338492, A338493, A338494, A338495, A338496.

A338496 Least number of octagonal pyramidal numbers needed to represent n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 31 2020

Keywords

Links

Crossrefs

Cf. A002414, A104246, A338458, A338481, A338493, A338494, A338495.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.