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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001367 Solution to f(2) = 1, f(n) = sqrt(n) f(sqrt(n)) + n at values n = 2^2^i. 1
1, 6, 40, 896, 294912, 23622320128, 119903836479112085504, 2552117751907038475975309555738261585920, 984232758517187661100353372573847216752794869657944794335389464067261601939456 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..11

MAPLE

f:= proc(n) f(n):= `if`(n=2, 1, sqrt(n) *f(sqrt(n)) +n) end:

a:= n-> f(2^(2^n)):

seq (a(n), n=0..10);  # Alois P. Heinz, Jun 27 2012

MATHEMATICA

f[ 2 ] := 1; f[ n_ ] := Sqrt[ n ]*f[ Sqrt[ n ] ] + n; Table[ f[ 2^2^i ], {i, 0, 7} ]

CROSSREFS

Sequence in context: A281262 A186196 A196478 * A096671 A196712 A086803

Adjacent sequences:  A001364 A001365 A001366 * A001368 A001369 A001370

KEYWORD

nonn

AUTHOR

Alexander Sorg (sorg(AT)bu.edu)

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 December 15 11:43 EST 2019. Contains 329999 sequences. (Running on oeis4.)