|
| |
| |
|
|
|
1, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
MAPLE
| Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 25 2010: (Start)
isA008364 := proc(n) if n = 1 then true; else min( op(numtheory[factorset](n)) ); if % > 7 then true; else false; end if; end if; end proc:
isA038511 := proc(n) if n = 1 then false; else min( op(numtheory[factorset](n)) ); if % >= 11 and not isprime(n) then true; else false; end if; end if; end proc:
for n from 1 to 300 do if isA008364(n) and not isA038511(n) then printf("%d, ", n) ; end if; end do: (End)
|
|
|
PROG
| (PARI) a(n)=if(n==1, 1, prime(n+3)) \\ Charles R Greathouse IV, Aug 26 2011
|
|
|
CROSSREFS
| Sequence in context: A056758 A096489 A008364 * A120533 A095862 A125845
Adjacent sequences: A140458 A140459 A140460 * A140462 A140463 A140464
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 22 2008
|
|
|
EXTENSIONS
| Entries checked by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 25 2010
|
| |
|
|
