Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152915
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152915 Exponacci (or exponential Fibonacci) numbers. +0
1
0, 1, 2, 9, 64, 3125, 1679616, 96889010407, 9223372036854775808 (list; graph; listen)
OFFSET

0,3

COMMENT

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

PROGRAM

(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 this_sequence A071300 A062395 A099975

Adjacent sequences: A152912 A152913 A152914 this_sequence A152916 A152917 A152918

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research