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!)
A067054 a(n) = floor(s^s) where s = Sum_{k=1..n} 1/k. 2

%I #13 Dec 21 2015 03:31:11

%S 1,1,3,4,6,8,11,15,18,23,28,33,39,46,53,61,70,79,89,100,111,123,137,

%T 150,165,181,197,215,233,252,273,294,316,340,364,389,416,443,472,502,

%U 533,565,598,633,669,706,745,784,825,868,911,956,1003,1051,1100,1151

%N a(n) = floor(s^s) where s = Sum_{k=1..n} 1/k.

%H Harry J. Smith, <a href="/A067054/b067054.txt">Table of n, a(n) for n = 1..1000</a>

%e a(6) = floor(1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6)^(1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6)) = floor(2.45^2.45) = floor(8.983734461...) = 8.

%p f:= proc(n) local v;

%p v:= floor((Psi(n+1)+gamma)^(Psi(n+1)+gamma)):

%p while not v::integer do

%p Digits:= 2*Digits;

%p v:= floor((Psi(n+1)+gamma)^(Psi(n+1)+gamma)):

%p od;

%p v

%p end proc:

%p seq(f(n),n=1..1000); # _Robert Israel_, Dec 21 2015

%t Table[ Floor[ Sum[ (1/i), {i, 1, n} ]^Sum[ (1/i), {i, 1, n} ]], {n, 1, 60} ]

%o (PARI) { s=0; for (n=1, 1000, s+=1/n; write("b067054.txt", n, " ", floor(s^s)) ) } \\ _Harry J. Smith_, May 01 2010

%K easy,nonn

%O 1,3

%A _Amarnath Murthy_, Jan 02 2002

%E Corrected and extended by _Robert G. Wilson v_, Jan 04 2002

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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)