login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A223888 Composite odious numbers (A000069) having no proper odious divisors greater than 1. 1
25, 69, 81, 87, 115, 145, 213, 265, 289, 339, 355, 391, 415, 445, 477, 493, 505, 529, 565, 695, 731, 747, 789, 815, 841, 901, 985, 1041, 1047, 1077, 1119, 1149, 1207, 1219, 1315, 1341, 1347, 1383, 1401, 1411, 1437, 1465, 1509, 1513, 1527, 1537, 1555, 1585 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The sequence is obtained using Eratosthenes-like sieve for odious numbers.

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

MATHEMATICA

odiousQ[n_] := OddQ@Total@IntegerDigits[n, 2]; okQ[n_] := n > 1 && odiousQ[n] && ! PrimeQ[n] && Catch[Do[If[odiousQ[d], Throw[False]], {d, Most@Rest@Divisors@n}]; True]; Select[Range@3000, okQ] (* Giovanni Resta, Mar 28 2013 *)

PROG

(PARI) isodi(n) = hammingweight(n) % 2;

noodid(n) = {fordiv(n, d, if ((d != 1) && (d < n) && isodi(d), return (0)); ); 1; }

lista(nn) = {forcomposite(n=1, nn, if (isodi(n) && noodid(n), print1(n, ", ")); ); } \\ Michel Marcus, Feb 08 2016

CROSSREFS

Cf. A000069, A001969, A217790.

Sequence in context: A278855 A137186 A109676 * A211572 A087239 A032653

Adjacent sequences:  A223885 A223886 A223887 * A223889 A223890 A223891

KEYWORD

nonn,base

AUTHOR

Vladimir Shevelev, Mar 28 2013

EXTENSIONS

a(10)-a(48) from Giovanni Resta, Mar 28 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 1 06:45 EDT 2021. Contains 346384 sequences. (Running on oeis4.)