This site is supported by donations to The OEIS Foundation.

 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!)
 A168138 a(n) = Fibonacci(n+1)^tau(n). 1

%I

%S 1,4,9,125,64,28561,441,1336336,166375,62742241,20736,160005726539569,

%T 142129,138458410000,949005240561,10387823949447757,6677056,

%U 5341718593932745951081,45765225,1720016697051086543327296,98394841894789441

%N a(n) = Fibonacci(n+1)^tau(n).

%H G. C. Greubel, <a href="/A168138/b168138.txt">Table of n, a(n) for n = 1..100</a>

%F a(n) = A000045(n+1)^A000005(n). - _R. J. Mathar_, Jan 30 2010

%p A168138 := proc(n) combinat[fibonacci](n+1)^numtheory[tau](n) ; end proc: seq(A168138(n),n=1..50) ; # _R. J. Mathar_, Jan 30 2010

%t Table[Fibonacci[n + 1]^DivisorSigma[0, n], {n, 0, 25}] (* _G. C. Greubel_, Jul 14 2016 *)

%o (MAGMA) [Fibonacci(n+1)^DivisorSigma(0, n): n in [1..25]]; // _Vincenzo Librandi_, Jul 14 2016

%o (PARI) a(n) = fibonacci(n+1)^numdiv(n); \\ _Michel Marcus_, Jul 14 2016

%K nonn

%O 1,2

%A _Giovanni Teofilatto_, Nov 19 2009

%E All terms from a(4) on corrected by _R. J. Mathar_, Jan 30 2010

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.

Last modified December 5 13:26 EST 2019. Contains 329751 sequences. (Running on oeis4.)