Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048736
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048736 Dana Scott's sequence: a(n) = (a(n-2)+a(n-1)*a(n-3))/a(n-4). +0
5
1, 1, 1, 1, 2, 3, 5, 13, 22, 41, 111, 191, 361, 982, 1693, 3205, 8723, 15042, 28481, 77521, 133681, 253121, 688962, 1188083, 2249605, 6123133, 10559062, 19993321, 54419231, 93843471, 177690281, 483649942, 834032173, 1579219205, 4298430243 (list; graph; listen)
OFFSET

0,5

REFERENCES

David Gale, "The strange and surprising saga of the Somos sequence", Mathematical Intelligencer 13(1) (1991), pp. 40-42.

D. Gale, Tracking the Automatic Ant and Other Mathematical Explorations, A Collection of Mathematical Entertainments Columns from The Mathematical Intelligencer, Springer, 1998, p. 4.

LINKS

T. D. Noe, Table of n, a(n) for n=0..500

FORMULA

a(n)=9*a(n-3)-a(n-6)-3-(0!=n%3), a(0)=a(1)=a(2)=a(3)=1, a(4)=2, a(5)=3 (from Michael Somos)

CROSSREFS

Cf. A006720, A006721, A006722, A006723.

Sequence in context: A087763 A104735 A061305 this_sequence A087898 A072537 A089477

Adjacent sequences: A048733 A048734 A048735 this_sequence A048737 A048738 A048739

KEYWORD

nonn,easy,nice

AUTHOR

David Johnson-Davies (David(AT)interface.co.uk)

EXTENSIONS

More terms from Michael Somos

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research