Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131609
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131609 Mirror image of triangle in A131606. +0
3
1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 1, 3, 9, 27, 81, 1, 5, 25, 125, 625, 3125, 1, 8, 64, 512, 4096, 32768, 262144 (list; table; graph; listen)
OFFSET

0,8

COMMENT

Row sums give A131612,

FORMULA

Row n gives f^0, f^1, f^2, ..., f^n, where f = Fibonacci(n) = A000045(n).

EXAMPLE

Triangle begins:

1

1 1

1 1 1

1 2 4 8

1 3 9 27 81

1 5 25 125 625 3125

1 8 64 512 4096 32768 262144

CROSSREFS

Cf. A000045, A131606.

Sequence in context: A133145 A008952 A021407 this_sequence A100880 A102256 A000455

Adjacent sequences: A131606 A131607 A131608 this_sequence A131610 A131611 A131612

KEYWORD

nonn,tabl,easy,more

AUTHOR

Roger Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), May 27 2008

EXTENSIONS

Edited by njas, May 28 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 December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research