login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062071 a(n) = [n/1] +[n/(2^2)] + [n/(3^3)] + [n/(4^4)]+...+[n/(k^k)+..., up to infinity, where [ ] is the floor function. 1
1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 20, 21, 22, 23, 25, 26, 27, 28, 30, 31, 32, 34, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 49, 51, 52, 53, 54, 56, 57, 58, 59, 61, 62, 63, 64, 66, 67, 69, 70, 72, 73, 74, 75, 77, 78, 79, 80, 82, 83, 84, 85, 87, 88, 89, 90 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = Sum_{i=1..n} floor(n/i^i). - Wesley Ivan Hurt, Sep 15 2017

EXAMPLE

a(7) = [7/1] + [7/4] + [7/27] + ...= 7+1+0+0... =8. a(8) = [ 8/1] + [8/4] + [8/27] + [8/256]+ ...= 8 + 2 + 0 + 0 + ... = 10.

PROG

(PARI) \p 10 v=[]; for(n=1, 120, v=concat(v, suminf(k=1, floor(n/k^k)))); v

(PARI) for (n=1, 1000, write("b062071.txt", n, " ", suminf(k=1, n\k^k)\1) ) \\ Harry J. Smith, Jul 31 2009

(PARI) a(n)=sum(k=1, exp(lambertw(log(n)))+1, n\k^k) \\ Charles R Greathouse IV, May 28 2015

CROSSREFS

Cf. A011371.

Sequence in context: A039145 A242491 A038129 * A087069 A023737 A037459

Adjacent sequences:  A062068 A062069 A062070 * A062072 A062073 A062074

KEYWORD

nonn,easy

AUTHOR

Amarnath Murthy, Jun 13 2001

EXTENSIONS

More terms from Jason Earls, Jun 21 2001

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 July 20 01:17 EDT 2019. Contains 325168 sequences. (Running on oeis4.)