|
| |
|
|
A155911
|
|
Composite numbers such that final digit = number of prime factors.
|
|
0
| |
|
|
22, 24, 54, 62, 63, 82, 84, 96, 104, 122, 142, 153, 184, 202, 204, 216, 234, 262, 273, 294, 302, 333, 336, 343, 344, 362, 363, 364, 382, 405, 414, 416, 422, 423, 424, 444, 482, 483, 484, 486, 502, 542, 562, 564, 584, 603, 622, 644, 662, 663, 664, 675, 714
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Prime factors counted with multiplicity. [From Harvey P. Dale, Nov 29 2011]
|
|
|
MAPLE
| A010879 := proc(n) n mod 10 ; end: A001222 := proc(n) numtheory[bigomega](n); end: for n from 4 to 2000 do if not isprime(n) then if A010879(n) = A001222(n) then printf("%d, ", n) ; fi; fi; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 31 2009]
|
|
|
MATHEMATICA
| With[{upto=800}, Select[Complement[Range[upto], Prime[Range[ PrimePi[ upto]]]], Last[ IntegerDigits[#]] ==PrimeOmega[#]&]] (* From Harvey P. Dale, Nov 29 2011 *)
|
|
|
CROSSREFS
| Cf. A002808.
Sequence in context: A030593 A138603 A181454 * A061411 A053779 A177734
Adjacent sequences: A155908 A155909 A155910 * A155912 A155913 A155914
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jan 30 2009
|
|
|
EXTENSIONS
| Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 31 2009
|
| |
|
|
