Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005832
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005832 Product k^(2^(k-1)), k = 1..n.
(Formerly M3724)
+0
1
1, 4, 324, 21233664, 3240000000000000000, 25786061996226338865429872640000000000000000 (list; graph; listen)
OFFSET

1,2

REFERENCES

M. E. Mays, A worst case of the Fibonacci-Sylvester expansion, J. Combin. Math. Combin. Computing, 1 (1987), 141-148.

CROSSREFS

Adjacent sequences: A005829 A005830 A005831 this_sequence A005833 A005834 A005835

Sequence in context: A027512 A034226 A053917 this_sequence A075768 A135442 A086895

KEYWORD

nonn,easy

AUTHOR

njas, Jeffrey Shallit

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research