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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168138 a(n) = Fibonacci(n+1)^tau(n). 1
1, 4, 9, 125, 64, 28561, 441, 1336336, 166375, 62742241, 20736, 160005726539569, 142129, 138458410000, 949005240561, 10387823949447757, 6677056, 5341718593932745951081, 45765225, 1720016697051086543327296, 98394841894789441 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..100

FORMULA

a(n) = A000045(n+1)^A000005(n). - R. J. Mathar, Jan 30 2010

MAPLE

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

MATHEMATICA

Table[Fibonacci[n + 1]^DivisorSigma[0, n], {n, 0, 25}] (* G. C. Greubel, Jul 14 2016 *)

PROG

(MAGMA) [Fibonacci(n+1)^DivisorSigma(0, n): n in [1..25]]; // Vincenzo Librandi, Jul 14 2016

(PARI) a(n) = fibonacci(n+1)^numdiv(n); \\ Michel Marcus, Jul 14 2016

CROSSREFS

Sequence in context: A225739 A065379 A063783 * A267898 A324981 A128524

Adjacent sequences:  A168135 A168136 A168137 * A168139 A168140 A168141

KEYWORD

nonn

AUTHOR

Giovanni Teofilatto, Nov 19 2009

EXTENSIONS

All terms from a(4) on corrected by R. J. Mathar, Jan 30 2010

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 November 19 22:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)