|
| |
| |
|
|
|
6, 10, 14, 18, 20, 22, 26, 28, 30, 34, 36, 38, 42, 44, 46, 50, 52, 54, 58, 60, 62, 66, 68, 70, 72, 74, 76, 78, 82, 84, 86, 88, 90, 92, 94, 98, 100, 102, 104, 106, 108, 110, 114, 116, 118, 120, 122, 124, 126, 130, 132, 134, 136, 138, 140, 142, 146, 148, 150, 152
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The union of this sequence and the sequence of odd positive integers is sequence A116883.
|
|
|
LINKS
| Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| The highest odd divisor of 20 (which is 5) is greater than the highest power of 2 dividing 20 (which is 4) and 20 is even, so 20 is in this sequence.
|
|
|
MATHEMATICA
| a = {}; For[n = 2, n < 200, n = n + 2, If[Select[Divisors[n], OddQ[ # ] &][[ -1]]^2 > n - 1, AppendTo[a, n]]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007
|
|
|
PROG
| (PARI) list(lim)=my(v=List(), t, M); forstep(k=3, lim\2, 2, t=k+k; M=min(lim, k^2); while(t<=M, listput(v, t); t+=t)); vecsort(Vec(v)) \\ Charles R Greathouse IV, Mar 16, 2011
|
|
|
CROSSREFS
| Cf. A116883.
Sequence in context: A167200 A077667 A091577 * A133653 A073760 A136767
Adjacent sequences: A115033 A115034 A115035 * A115037 A115038 A115039
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Leroy Quet Feb 26 2006
|
|
|
EXTENSIONS
| More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007
|
| |
|
|
