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!)
A014964 a(n) = lcm(n, 2^(n-1)). 1

%I #31 Apr 01 2018 18:12:02

%S 1,2,12,8,80,96,448,128,2304,2560,11264,6144,53248,57344,245760,32768,

%T 1114112,1179648,4980736,2621440,22020096,23068672,96468992,25165824,

%U 419430400,436207616,1811939328

%N a(n) = lcm(n, 2^(n-1)).

%H Harvey P. Dale, <a href="/A014964/b014964.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>

%F a(n) = n * A084623(n). - _Paul Curtz_, May 21 2016.

%t Table[LCM[n,2^(n-1)],{n,30}] (* _Harvey P. Dale_, Jun 03 2012 *)

%Y Cf. A000027, A084623.

%K nonn

%O 1,2

%A _N. J. A. Sloane_

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 March 28 14:02 EDT 2024. Contains 371254 sequences. (Running on oeis4.)