login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001543 a(0) = 1, a(n) = 5 + product(i = 0..n - 1) a(i) for n > 0.
(Formerly M4091 N1699)
3
1, 6, 11, 71, 4691, 21982031, 483209576974811, 233491495280173380882643611671 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

This is the special case k=5 of sequences with exact mutual k-residues. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=k, i=1,...,n-1}. k=1 gives Sylvester's sequence A000058 and k=2 Fermat sequence A000215. - Seppo Mustonen (seppo.mustonen(AT)helsinki.fi), Sep 04 2005

REFERENCES

S. W. Golomb, On certain nonlinear recurring sequences, Amer. Math. Monthly 70 (1963), 403-405.

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).

LINKS

A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.

S. Mustonen, On integer sequences with mutual k-residues

Index entries for sequences of form a(n+1)=a(n)^2 + ...

FORMULA

a(n) = a(n-1) * (a(n-1) - 5) + 5. [Charles R Greathouse IV, Dec 09 2011]

PROG

(PARI) {

  print1("1, 6");

  n=6;

  m=Mod(5, 6);

  for(i=2, 9,

    n=m.mod+lift(m);

    m=chinese(m, Mod(5, n));

    print1(", "n)

  )

} \\ Charles R Greathouse IV, Dec 09 2011

CROSSREFS

Sequence in context: A061519 A193664 A080875 * A077705 A077697 A013321

Adjacent sequences:  A001540 A001541 A001542 * A001544 A001545 A001546

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

New name from Alonso del Arte, Dec 09 2011.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.