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
%I A001544 M4346 N1820
%S A001544 1,7,13,97,8833,77968897,6079148431583233,
%T A001544 36956045653220845240164417232897,
%U A001544 1365749310322943329964576677590044473746108255675592519835615233
%N A001544 A nonlinear recurrence.
%C A001544 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
%D A001544 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001544 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001544 S. W. Golomb, On certain nonlinear recurring sequences, Amer. Math. Monthly 
               70 (1963), 403-405.
%H A001544 S. Mustonen, <a href="http://www.survo.fi/papers/resseq.pdf">On integer 
               sequences with mutual k-residues</a>
%F A001544 a(0)=1, a(1)=7, a(n)=a(n-1)^2-6*a(n-1)+6 if n>1.
%o A001544 (PARI) a(n)=if(n<1, n==0, if(n==1, 7, n=a(n-1); n^2-6*n+6))
%Y A001544 Sequence in context: A132373 A110293 A039687 this_sequence A136720 A035030 
               A046519
%Y A001544 Adjacent sequences: A001541 A001542 A001543 this_sequence A001545 A001546 
               A001547
%K A001544 nonn
%O A001544 0,2
%A A001544 N. J. A. Sloane (njas(AT)research.att.com).

    
page 1

Search completed in 0.001 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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research