login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038511 Composite numbers with smallest prime factor >= 11. 3
121, 143, 169, 187, 209, 221, 247, 253, 289, 299, 319, 323, 341, 361, 377, 391, 403, 407, 437, 451, 473, 481, 493, 517, 527, 529, 533, 551, 559, 583, 589, 611, 629, 649, 667, 671, 689, 697, 703, 713, 731, 737, 767, 779, 781, 793, 799, 803, 817, 841, 851 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Composite n such that n^6 is congruent to {1, 169} mod 210. All primes > 7 satisfy this condition. [Gary Detlefs, Dec 09 2012]

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

FORMULA

a(n) ~ 4.375n. - Charles R Greathouse IV, Dec 10 2012

MAPLE

for n from 1 to 1000 do if (n^6 mod 210 = 1 or n^6 mod 210 = 169) and not isprime(n) then print(n) fi od; # Gary Detlefs, Dec 09 2012

MATHEMATICA

Select[Range[1000], Not[PrimeQ[#]] && FactorInteger[#][[1, 1]] > 7 &] (* Alonso del Arte, Dec 09 2012 *)

PROG

(PARI) is(n)=gcd(210, n)==1 && !isprime(n) \\ Charles R Greathouse IV, Dec 10 2012

CROSSREFS

Sequence in context: A020253 A182776 A080466 * A062649 A206288 A242372

Adjacent sequences:  A038508 A038509 A038510 * A038512 A038513 A038514

KEYWORD

nonn

AUTHOR

Jeff Burch

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 24 01:09 EST 2014. Contains 249867 sequences.