|
Search: id:A101550
|
|
|
| A101550 |
|
Lopsided (or biased) numbers: numbers n such that the largest prime factor of n is > 2*sqrt(n). |
|
+0
2
|
|
| 5, 7, 11, 13, 17, 19, 22, 23, 26, 29, 31, 34, 37, 38, 39, 41, 43, 46, 47, 51, 53, 57, 58, 59, 61, 62, 67, 68, 69, 71, 73, 74, 76, 79, 82, 83, 86, 87, 89, 92, 93, 94, 97, 101, 103, 106, 107, 109, 111, 113, 115, 116, 118, 122, 123, 124, 127, 129, 131, 134, 137, 139, 141
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Note that all primes > 3 are here. See A101549 for composite lopsided numbers.
|
|
REFERENCES
|
G. Everest et al., Primes generated by recurrence sequences, Amer. Math. Monthly, 114 (No. 5, 2007), 417-431.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..1000
G. Everest, S. Stevens, D. Tamsett and T. Ward, Primitive Divisors of Quadratic Polynomial Sequences
|
|
MAPLE
|
with(numtheory): a:=proc(n) if max((seq(factorset(n)[j], j=1..nops(factorset(n)))))^2>4*n then n else fi end: seq(a(n), n=2..170); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 27 2007
|
|
MATHEMATICA
|
Select[Range[2, 200], FactorInteger[ # ][[ -1, 1]]>2Sqrt[ # ]&]
|
|
CROSSREFS
|
Cf. A063763 (composite n such that the largest prime factor > sqrt(n)), A064052 (n such that the largest prime factor > sqrt(n)).
Sequence in context: A035035 A113909 A111906 this_sequence A136801 A106571 A067291
Adjacent sequences: A101547 A101548 A101549 this_sequence A101551 A101552 A101553
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Dec 06 2004
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 02 2008 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
