A379784 Similar to A379899 but start with 1 instead of 2.
1, 5, 3, 7, 11, 19, 23, 31, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, 43, 47, 59, 67, 71, 79, 83, 103, 107, 127, 131, 139, 151, 163, 167, 179, 191, 199, 211, 223, 227, 239, 251, 263, 271, 283, 307, 311, 331, 347, 359, 367, 379, 383, 137, 149, 157, 173, 181, 193, 197, 229, 233, 241, 257, 269, 277, 281, 293, 313
Offset: 1
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..20000
Crossrefs
Cf. A379899.
Programs
-
Maple
b:= proc(n) option remember; `if`(n<1, {}, b(n-1) union {a(n)}) end: a:= proc(n) option remember; local c, p; p:= infinity; for c from a(n-1)+4 by 4 while p=infinity do p:= min(numtheory[factorset](c) minus b(n-1)) od; p end: a(1):=1: seq(a(n), n=1..200); # Alois P. Heinz, Jan 11 2025