Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001685
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001685 a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*prod_{i=1..n-3} a(i).
(Formerly M0740 N0278)
+0
8
1, 2, 3, 5, 13, 83, 2503, 976253, 31601312113, 2560404986164794683, 202523113189037952478722304798003, 506227391211661106785411233681995783881012463859772443053 (list; graph; listen)
OFFSET

0,2

COMMENT

From a continued fraction.

Every term is relatively prime to all others. - Michael Somos Feb 01 2004

REFERENCES

V. C. Harris, Another proof of the infinitude of primes, Amer. Math. Monthly, 63 (1956), 711.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

PROGRAM

(PARI) a(n)=if(n<3, max(0, n+1), a(n-2)+a(n-1)*prod(i=1, n-3, a(i))) - Michael Somos Feb 01 2004

CROSSREFS

Cf. A003686, A064526.

Sequence in context: A042695 A074394 A056162 this_sequence A074691 A139589 A152114

Adjacent sequences: A001682 A001683 A001684 this_sequence A001686 A001687 A001688

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 12 2006

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 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research