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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110407 Integers with mutual residues -2. 2
3, 5, 13, 193, 37633, 1416317953, 2005956546822746113, 4023861667741036022825635656102100993, 16191462721115671781777559070120513664958590125499158514329308740975788033 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

This is the special case k=2 of sequences with mutual residues -k. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=-k, i=1,...,n-1}.

An infinite coprime sequence

LINKS

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

FORMULA

a(1)=3, a(2)=5, a(n)=-2+a(1)*a(2)*...*a(n-1) [typo corrected by Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 08 2010]

a(n)=a(n-1)^2+2*a(n-1)-2, for n>3.

Apparently a(n)=A003010(n-2)-1 for n>=3. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 22 2007

MAPLE

a:=proc(k, n::nonnegint) option remember; if n<3 then RETURN(n*k+1); fi; if n=3 then RETURN(a(k, 1)*a(k, 2)-k); fi; a(k, n-1)*(a(k, n-1)+k)-k; end; seq(a(2, n), n=1..9);

CROSSREFS

Sequence in context: A121533 A087170 A123370 * A062698 A200769 A128341

Adjacent sequences:  A110404 A110405 A110406 * A110408 A110409 A110410

KEYWORD

nonn

AUTHOR

Seppo Mustonen (seppo.mustonen(AT)helsinki.fi), Sep 11 2005

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 17 06:27 EST 2012. Contains 205998 sequences.