The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068573 a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4. 0

%I #5 Mar 30 2012 17:37:52

%S 3,4,6,16,31,43,67,79,163,175,223,235,343,475,487,559,823,847,967,979,

%T 1027,1195,1279,2455,2575,2611,2899,3163,3199,3511,3643,3691,5383,

%U 5395,5647,6499,7819,8287,8479,8563,8599,9007,9091,9115,10483,11011

%N a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.

%e a(3) cannot be 5, since 4 divides 3+5; but a(3)=6 since 3 does not divide 4+6, 4 does not divide 3+6 and 6 does not divide 3+4.

%K nonn

%O 1,1

%A _John W. Layman_, Mar 26 2002

%E Corrected by _T. D. Noe_, Oct 25 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 04:25 EDT 2024. Contains 372536 sequences. (Running on oeis4.)