Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001544
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001544 A nonlinear recurrence.
(Formerly M4346 N1820)
+0
2
1, 7, 13, 97, 8833, 77968897, 6079148431583233, 36956045653220845240164417232897, 1365749310322943329964576677590044473746108255675592519835615233 (list; graph; listen)
OFFSET

0,2

COMMENT

This is the special case k=6 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 4 2005

REFERENCES

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

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

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

LINKS

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

FORMULA

a(0)=1, a(1)=7, a(n)=a(n-1)^2-6*a(n-1)+6 if n>1.

PROGRAM

(PARI) a(n)=if(n<1, n==0, if(n==1, 7, n=a(n-1); n^2-6*n+6))

CROSSREFS

Sequence in context: A132373 A110293 A039687 this_sequence A136720 A035030 A046519

Adjacent sequences: A001541 A001542 A001543 this_sequence A001545 A001546 A001547

KEYWORD

nonn

AUTHOR

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

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 December 5 17:24 EST 2009. Contains 170342 sequences.


AT&T Labs Research