The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A335099 Lexicographically earliest sequence of distinct integers greater than 1 such that a(n) mod a(i)^2 >= a(i) for all i < n. 0
 2, 3, 6, 7, 14, 15, 22, 23, 26, 30, 31, 34, 35, 42, 43, 58, 59, 62, 66, 67, 70, 71, 78, 79, 86, 87, 94, 95, 106, 107, 114, 115, 122, 123, 130, 131, 134, 138, 139, 142, 143, 158, 159, 166, 167, 170, 174, 175, 178, 179, 186, 187, 194, 195, 210, 211, 214, 215, 222 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In the sieve of Eratosthenes, first the even numbers are removed, then the multiples of 3, then multiples of 5. In this sieve first the numbers greater than 2 and modulo 0 or 1 (mod 4) are removed leaving (1) 2, 3, 6, 7, 10, 11, 14, 15. Then the numbers greater than 3 and modulo 0, 1, 2 (mod 9) are removed leaving (1) 2, 3, 6, 7, 14, 15. Then numbers modulo 0, 1, 2, 3, 4, 5 (mod 36) are removed. LINKS PROG (Python3) from math import sqrt length=100 s=list(range(2, length)) for p in range(int(sqrt(length))):     x = s[p]     if x==0 : continue     for i, e in enumerate(s):         if e>x and e%(x*x)

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.

Last modified May 17 13:24 EDT 2022. Contains 353746 sequences. (Running on oeis4.)