|
Search: id:A045954
|
|
|
| A045954 |
|
Even-Lucky-Numbers (ELN): generated by a sieve process like that for Lucky numbers but starting with even numbers. |
|
+0
17
|
|
| 2, 4, 6, 10, 12, 18, 20, 22, 26, 34, 36, 42, 44, 50, 52, 54, 58, 68, 70, 76, 84, 90, 98, 100, 102, 108, 114, 116, 118, 130, 132, 138, 140, 148, 150, 164, 170, 172, 178, 182, 186, 196, 198, 212, 214, 218, 228, 230, 234, 244, 246, 260, 262, 268, 278, 282, 290, 298, 300, 308
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Write down even numbers: 2 4 6 8 ...; first term > 2 is 4 so starting from 2 remove every 4th number: 2 4 6 10 12 14 18...; next number is 6 so remove every 6th term starting from 2: 2 4 6 10 12 18 20 22 26 etc.
|
|
LINKS
|
Index entries for sequences generated by sieves
|
|
MAPLE
|
## Finds all Even Lucky Numbers up to n from the list 2...n. ## Try n=10^5 or 10^6 just for fun! evenluckynumbers:=proc(n) local k, Lnext, Lprev; Lprev:=[$2..n]; for k from 1 do Lnext:= map(w-> Lprev[w], remove(z -> z mod Lprev[k] = 0, [$1..nops(Lprev)])); if nops(Lnext)=nops(Lprev) then return Lnext fi; Lprev:=Lnext; od; end: - Walter A. Kehowski (wkehowski(AT)cox.net), Jun 06 2008
|
|
MATHEMATICA
|
lst = Range[2, 308, 2]; i = 2; While[ i <= (len = Length@lst) && (k = lst[[i]]) <= len, lst = Drop[lst, {k, len, k}]; i++ ]; lst (from Robert G. Wilson v (rgwv(at)rgwv.com), May 11 2006)
|
|
CROSSREFS
|
A000959, A039672.
Sequence in context: A024907 A033098 A033868 this_sequence A072542 A092249 A002088
Adjacent sequences: A045951 A045952 A045953 this_sequence A045955 A045956 A045957
|
|
KEYWORD
|
nice,nonn,easy
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com)
|
|
|
Search completed in 0.002 seconds
|
