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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325386 Numbers n such that for any divisor d of n and some k, A048720(d,k) = n only for trivial cases d=1 and d=n, despite that n is neither prime nor in A014580. 2
 69, 77, 81, 121, 169, 205, 209, 261, 265, 275, 289, 295, 305, 321, 323, 327, 329, 339, 377, 405, 407, 437, 453, 473, 475, 481, 493, 517, 533, 551, 553, 555, 559, 565, 575, 581, 583, 595, 625, 649, 667, 671, 699, 703, 707, 737, 747, 749, 755, 763, 767, 779, 785, 805, 815, 833, 835, 849, 851, 855, 861, 869, 871, 885, 893, 905, 923, 925 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 PROG (PARI) A325560(n) = { my(p = Pol(binary(n))*Mod(1, 2)); sumdiv(n, d, my(q = Pol(binary(d))*Mod(1, 2)); !(p%q)); }; isA325386(n) = (!isprime(n) && !polisirreducible(Pol(binary(n))*Mod(1, 2)) && (2 == A325560(n))); CROSSREFS Terms of A325559 not in A257688. Subsequence of A005408 (odd numbers). Cf. A014580, A325560. Differs from A260428 for the first time at n=32, where a(32) = 555, a value missing from A260428. Sequence in context: A256694 A166067 A253437 * A260428 A168477 A264045 Adjacent sequences:  A325383 A325384 A325385 * A325387 A325388 A325389 KEYWORD nonn AUTHOR Antti Karttunen, May 11 2019 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.

Last modified January 21 13:55 EST 2020. Contains 331113 sequences. (Running on oeis4.)