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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152915 Exponacci (or exponential Fibonacci) numbers. 0
0, 1, 2, 9, 64, 3125, 1679616, 96889010407, 9223372036854775808, 278128389443693511257285776231761, 10000000000000000000000000000000000000000000000000000000 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(0) = 0

a(1) = 1

a(n) = n ^ Fibonacci(n), n > 1

n is a natural number and Fibonacci(n) is the Fibonacci number.

LINKS

Wikipedia, Fibonacci number

FORMULA

a(n) = 0 if n = 0

a(n) = 1 if n = 1

a(n) = n ^ Fibonacci(n) if n > 1

EXAMPLE

a(9) = 9 ^ Fibonacci(9) = 9 ^ 34

MATHEMATICA

Array[ #^Fibonacci[ # ]&, 12] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2010]

PROG

(Other) unsigned long Exponacci(unsigned int n)

{

if (n == 0)

return 0;

if (n == 1)

return 1;

return pow(n, Fibonacci(n));

}

CROSSREFS

Cf. A000045

Sequence in context: A112319 A038038 A048801 * A168383 A071300 A062395

Adjacent sequences:  A152912 A152913 A152914 * A152916 A152917 A152918

KEYWORD

nonn

AUTHOR

ShaoJun Ying (dolphinysj(AT)gmail.com), Dec 15 2008

EXTENSIONS

More terms from Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 07:16 EST 2012. Contains 205589 sequences.