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!)
A151784 a(n) = 6^(wt(n) - 1) where wt(n) = A000120(n). 2

%I #17 Nov 17 2022 05:27:10

%S 1,1,6,1,6,6,36,1,6,6,36,6,36,36,216,1,6,6,36,6,36,36,216,6,36,36,216,

%T 36,216,216,1296,1,6,6,36,6,36,36,216,6,36,36,216,36,216,216,1296,6,

%U 36,36,216,36,216,216,1296,36,216,216,1296,216,1296,1296,7776,1,6,6,36,6,36,36

%N a(n) = 6^(wt(n) - 1) where wt(n) = A000120(n).

%e From _Omar E. Pol_, Jul 21 2009: (Start)

%e If written as a triangle:

%e 1;

%e 1,6;

%e 1,6,6,36;

%e 1,6,6,36,6,36,36,216;

%e 1,6,6,36,6,36,36,216,6,36,36,216,36,216,216,1296;

%e 1,6,6,36,6,36,36,216,6,36,36,216,36,216,216,1296,6,36,36,216,36,216,216,...

%e (End)

%o (Python 3.10+)

%o def A151784(n): return 6**(n.bit_count()-1) # _Chai Wah Wu_, Nov 15 2022

%o (PARI) a(n) = 6^(hammingweight(n)-1); \\ _Michel Marcus_, Nov 15 2022

%Y Cf. A000120, A048881, A048896, A147610, A151780, A151783, A000120.

%Y Cf. A000400. - _Omar E. Pol_, Jul 21 2009

%K nonn

%O 1,3

%A _N. J. A. Sloane_, Jun 25 2009

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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)