Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005831
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005831 a(n+1)=a(n)(a(n-1)+1).
(Formerly M1264)
+0
2
1, 1, 2, 4, 12, 60, 780, 47580, 37159980, 1768109008380, 65702897157329640780, 116169884340604934905464739377180, 7632697963609645128663145969343357330533515068777580 (list; graph; listen)
OFFSET

0,3

REFERENCES

M. E. Mays, Iterating the division algorithm, Fib. Quart., 25 (1987), 204-213.

CROSSREFS

Cf. A007807.

Sequence in context: A118456 A013202 A004400 this_sequence A137160 A013207 A078919

Adjacent sequences: A005828 A005829 A005830 this_sequence A005832 A005833 A005834

KEYWORD

nonn,easy,nice

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research