Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108890
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108890 Floor(product{k=1 to n} (sum{j=1 to k} 1/j)). +0
1
1, 1, 2, 5, 13, 32, 83, 225, 638, 1871, 5651, 17537, 55772, 181348, 601754, 2034368, 6997316, 24456376, 86764857, 312157366, 1137925574, 4199870789, 15683541837, 59220398058, 225982562259, 871031643495, 3389581971377, 13311468152196 (list; graph; listen)
OFFSET

1,3

MATHEMATICA

f[n_] := Floor[ Product[ Sum[1/j, {j, k}], {k, n}]]; Table[ f[n], {n, 28}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 18 2005)

PROGRAM

(PARI) for(n=1, 50, print1(floor(prod(k=1, n, sum(j=1, k, 1/j))), ", ")) (Klasen)

CROSSREFS

Cf. A097423, A097424.

floor(A097423/A097424).

Sequence in context: A098156 A098586 A110320 this_sequence A027929 A001659 A088921

Adjacent sequences: A108887 A108888 A108889 this_sequence A108891 A108892 A108893

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jul 14 2005

EXTENSIONS

More terms from Lambert Klasen (lambert.klasen(AT)gmx.net), Hauke Worpel (hw1(AT)email.com), Ryan Propper (rpropper(AT)stanford.edu) and Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 18 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research