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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130569 Numbers of the form k*2^m + 1 for k odd, m >=1, that are not Proth numbers (A080075) (2^m <= k). 0
7, 11, 15, 19, 21, 23, 27, 29, 31, 35, 37, 39, 43, 45, 47, 51, 53, 55, 59, 61, 63, 67, 69, 71, 73, 75, 77, 79, 83, 85, 87, 89, 91, 93, 95, 99, 101, 103, 105, 107, 109, 111, 115, 117, 119, 121, 123, 125, 127, 131, 133, 135, 137, 139, 141, 143, 147, 149, 151, 153, 155 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(1)=7 because 7 = 3*2^1 + 1 and 2^1 <= 3,

a(2)=11 because 11 = 5*2^1 + 1 and 2^1 <= 5,

a(3)=15 because 15 = 7*2^1 + 1 amd 2^1 <= 7, ...

MAPLE

ts_neProth:=proc(n) local i, j, k, a, am; k := 2: am:= [ ]: for i from 1 to n do for j from 1 by 2 to n do a := j*k^(i)+1: if (k^(i) <= j) then am := [op(am), a ]: fi: od: od: RETURN( sort(am) ) end: ts_neProth(200);

CROSSREFS

Sequence in context: A166257 A192992 A176852 * A078176 A097494 A037136

Adjacent sequences:  A130566 A130567 A130568 * A130570 A130571 A130572

KEYWORD

nonn

AUTHOR

Jani Melik (jani_melik(AT)hotmail.com), Aug 10 2007

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

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

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.