The OEIS is supported by the many generous donors to the OEIS Foundation.


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230454 Smallest odious number (A000069) that can be written as a product of n, but not fewer than n, evil numbers (A001969). 5
25, 575, 51175, 4554575 (list; graph; refs; listen; history; text; internal format)



This sequence is a subsequence of the sequence {b(n)} defined as follows:

"Odious numbers which can be written as a product of evil numbers." It differs from A230213 only at the 56th term (b_{56} = a(3) = 575.

An algorithm for calculation of {b(n)} is the following: Consider an odious number n. Let d_1 be the smallest evil divisor of n (if n does not have an evil divisor, then n is not in {b(n)}). If n/d_1 is either evil or odious but is already in {b(n)}, then n is in this sequence. If n/d_1 is odious and not in the sequence, then we consider the following evil divisor d_2 > d_1 (if d_2 does not exist, then n is not in {b(n)}). If n/d_2 is either evil or odious but already in this sequence, then n is in {b(n)}, etc. Formally, by a continuation of {b(n)} sufficiently far, we can calculate terms a(k), k=2,3,4,... A direct calculation, say, a(4) is connected with the finding of 4 evil primes p,q,r,s with the smallest possible product, such that all 11 numbers p*q, p*r, p*s, q*r, q*s, r*s, p*q*r, p*q*s, p*r*s, q*r*s, p*q*r*s* are odious. In this case we find p=5, q=5, r=23, s=89, such that a(4) = 5*5*23*89 = 51175.


Table of n, a(n) for n=2..5.

V. Shevelev,An idea of new 4 sequences


Cf. A000069, A001969, A227932, A230213, A230226, A230306, A230353, A230384, A230385, A230386, A230387.

Sequence in context: A226299 A264378 A015679 * A014909 A239822 A264220

Adjacent sequences: A230451 A230452 A230453 * A230455 A230456 A230457




Vladimir Shevelev and Peter J. C. Moses, Oct 19 2013



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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 18:02 EST 2023. Contains 359833 sequences. (Running on oeis4.)