|
| |
|
|
A154369
|
|
Composites with largest prime factor mod smallest prime factor = prime.
|
|
0
| |
|
|
15, 33, 35, 45, 51, 65, 69, 75, 85, 87, 99, 115, 119, 123, 133, 135, 141, 143, 153, 159, 161, 165, 175, 177, 185, 207, 213, 215, 217, 225, 231, 235, 245, 249, 255, 259, 261, 265, 267, 297, 303, 319, 321, 323, 325, 329, 335, 339, 345, 357, 363, 365, 369, 375
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| If composite(35)=51=17*3 and (17 mod 3)=2(prime), then 51=a(5). If composite(46)=65=13*5 and (13 mod 5)=3(prime), then 65=a(6). If composite(53)=75=5*5*3 and (5 mod 3)=2(prime), then 75=a(7).
|
|
|
MAPLE
| Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 05 2010: (Start)
A020639 := proc(n) numtheory[factorset](n) ; min(op(%)) ; end proc:
A006530 := proc(n) numtheory[factorset](n) ; max(op(%)) ; end proc:
for n from 1 to 500 do if isprime( A006530(A002808(n)) mod A020639(A002808(n)) ) then printf("%d, ", A002808(n) ) ; end if; end do: (End)
|
|
|
CROSSREFS
| Cf. A000040. A002808.
Sequence in context: A112147 A199743 A180815 * A089966 A050384 A142862
Adjacent sequences: A154366 A154367 A154368 * A154370 A154371 A154372
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jan 08 2009
|
|
|
EXTENSIONS
| Corrected (133 inserted) and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 05 2010
|
| |
|
|
