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!)
A098572 a(n) = floor(Sum_{m=1..n} m^(1/m)). 3

%I

%S 1,2,3,5,6,7,9,10,11,13,14,15,16,18,19,20,21,22,23,25,26,27,28,29,30,

%T 31,33,34,35,36,37,38,39,40,42,43,44,45,46,47,48,49,50,51,53,54,55,56,

%U 57,58,59,60,61,62,63,64,65,67,68,69,70,71,72,73,74,75,76,77,78,79

%N a(n) = floor(Sum_{m=1..n} m^(1/m)).

%H G. C. Greubel, <a href="/A098572/b098572.txt">Table of n, a(n) for n = 1..5000</a>

%e floor(1^(1/1)+2^(1/2)+3^(1/3))=3 and floor(1^(1/1)+2^(1/2)+3^(1/3)+4^(1/4))=5.

%p A098572 := proc(p)

%p option remember;

%p add(root[i](i),i=1..p) ;

%p floor(%) ;

%p end proc:

%t Table[Floor[Sum[k^(1/k), {k, 1, n}]], {n, 1, 50}] (* _G. C. Greubel_, Feb 03 2018 *)

%o (PARI) for(n=1,30, print1(floor(sum(k=1,n, k^(1/k))), ", ")) \\ _G. C. Greubel_, Feb 03 2018

%o (Magma) [Floor((&+[k^(1/k): k in [1..n]])): n in [1..30]]; // _G. C. Greubel_, Feb 03 2018

%K easy,nonn

%O 1,2

%A Mark Hudson (mrmarkhudson(AT)hotmail.com), Sep 16 2004

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 March 29 06:08 EDT 2023. Contains 361596 sequences. (Running on oeis4.)