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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233419 Least m such that A232637(m) is divisible by k, where k is the n-th number not divisible by 4; or 0 if no such m exists. 2
1, 2, 6, 7, 12, 3, 21, 14, 15, 4, 5, 72, 73, 42, 34, 6, 29, 18, 7, 8, 21, 23, 144, 9, 273, 146, 97, 10, 68, 30, 11, 12, 76, 102, 36, 130, 13, 14, 90, 67, 42, 15, 72, 45, 75, 16, 17, 1056, 1057, 546, 185, 18, 194, 54, 19, 20, 95, 97, 60, 495, 21, 22, 105, 107, 152, 23, 112 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Conjecture: a(n) > 0 for all n. Equivalently, any number not divisible by 4 divides infinitely many members of A232637.

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

PROG

(PARI) ok(n)=hammingweight(n)%2 && hammingweight(n\2+1)%2

a(n)=my(k=n+(n-1)\3, m=k); while(!ok(m), m+=k); (m+6)\4 \\ Charles R Greathouse IV, Dec 09 2013

CROSSREFS

Cf. A232637, A000069, A042968.

Sequence in context: A051678 A079906 A226814 * A189327 A217575 A172154

Adjacent sequences:  A233416 A233417 A233418 * A233420 A233421 A233422

KEYWORD

nonn

AUTHOR

Charles R Greathouse IV, Dec 09 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 July 20 05:56 EDT 2019. Contains 325168 sequences. (Running on oeis4.)