login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A192988 Smallest number whose representation requires n pentagonal numbers with greedy algorithm. 1
1, 2, 3, 4, 9, 21, 91, 1517, 385318, 24745571498, 102057218155974827415, 1735945962956039658808082636319818286550 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

a(n+1) = ceiling(a(n)/3)*(3*ceiling(a(n)/3)-1)/2 + a(n), a(1) = 1.

EXAMPLE

a(7)=91 since 91 = 70 + 12 + 5 + 1 + 1 + 1 + 1.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = Ceiling[a[n - 1]/3]*(3*Ceiling[a[n - 1]/3] - 1)/2 + a[n - 1]; Table[a[n], {n, 15}] (* T. D. Noe, Jul 13 2011 *)

CROSSREFS

Cf. A145172.

Sequence in context: A086865 A258274 A228126 * A280016 A122534 A101135

Adjacent sequences:  A192985 A192986 A192987 * A192989 A192990 A192991

KEYWORD

nonn

AUTHOR

Franz Vrabec, Jul 13 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 09:29 EDT 2021. Contains 348220 sequences. (Running on oeis4.)