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!)
A075887 a(n) = 1 + n + n[n/2] + n[n/2][n/3] +... + n[n/2][n/3]...[n/n], where [x]=ceiling(x). 2
1, 2, 5, 16, 45, 171, 421, 1968, 4553, 19225, 57261, 226854, 496309, 3136420, 6764563, 24850336, 84877201, 380461599, 805949533, 4411165990, 9288196621, 48275465722, 154143694937, 527401107276, 1100708161081, 8151403215501 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) ~ L^n where L = 3.517487255902369649399793699323864170685620..., with log(L) = Sum_{k=1..inf} log(k+1)/(k*(k+1)) = 1.2577468869443696300... (cf. A131688).

LINKS

Paul D. Hanna, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = 1 + Sum_{m=1..n} Product_{k=1..m} ceiling(n/k) for n>0 and a(0)=1.

EXAMPLE

a(5) = 171 = 1 +5[5/2] +5[5/2][5/3] +5[5/2][5/3][5/4] +5[5/2][5/3][5/4][5/5] = 1 + 5 + 5*3 + 5*3*2 + 5*3*2*2 + 5*3*2*2*1, here [x]=ceiling(x).

MATHEMATICA

Table[1 +Sum[Product[Ceiling[n/k], {k, 1, j}], {j, 1, n}], {n, 0, 50}] (* G. C. Greubel, Oct 11 2018 *)

PROG

(PARI) {a(n) = 1 + sum(m=1, n, prod(k=1, m, ceil(n/k)))}

for(n=0, 40, print1(a(n), ", "))

(MAGMA) [1] cat [1 + (&+[(&*[Ceiling(n/k): k in [1..j]]): j in [1..n]]): n in [1..50]]; // G. C. Greubel, Oct 11 2018

CROSSREFS

Cf. A131385, A131688.

Sequence in context: A317890 A138573 A148375 * A306504 A148376 A148377

Adjacent sequences:  A075884 A075885 A075886 * A075888 A075889 A075890

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna, Oct 17 2002

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 August 15 17:39 EDT 2022. Contains 356148 sequences. (Running on oeis4.)