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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140451 a(1) = 1. a(n) = the smallest positive multiple of a(n-1) with exactly n 1's in its binary representation. 1

%I #14 Feb 10 2018 13:39:57

%S 1,3,21,105,4305,21525,5316675,3291021825,38046409656325181475

%N a(1) = 1. a(n) = the smallest positive multiple of a(n-1) with exactly n 1's in its binary representation.

%C Each term is odd.

%C a(10) = 2^617 + 2^529 + 2^527 + 2^401 + 2^352 + 2^284 + 2^240 + 2^239 + 2^154 + 1 has 186 decimal digits. - _Max Alekseyev_, Feb 04 2018

%C The sequence is infinite. - _Max Alekseyev_, Feb 04 2018

%H Max Alekseyev, <a href="/A140451/b140451.txt">Table of n, a(n) for n = 1..10</a>

%K base,nonn

%O 1,2

%A _Leroy Quet_, Jul 21 2008

%E First 8 terms calculated by _R. J. Mathar_ and _Jack Brennen_.

%E a(9) from _Max Alekseyev_, Jul 22 2008

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 April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)