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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014964 a(n) = lcm(n, 2^(n-1)). 1
 1, 2, 12, 8, 80, 96, 448, 128, 2304, 2560, 11264, 6144, 53248, 57344, 245760, 32768, 1114112, 1179648, 4980736, 2621440, 22020096, 23068672, 96468992, 25165824, 419430400, 436207616, 1811939328 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA a(n) = n * A084623(n). - Paul Curtz, May 21 2016. MATHEMATICA Table[LCM[n, 2^(n-1)], {n, 30}] (* Harvey P. Dale, Jun 03 2012 *) CROSSREFS Cf. A000027, A084623. Sequence in context: A306699 A332920 A266511 * A173181 A001898 A268230 Adjacent sequences: A014961 A014962 A014963 * A014965 A014966 A014967 KEYWORD nonn AUTHOR STATUS approved

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.

Last modified December 5 18:02 EST 2022. Contains 358588 sequences. (Running on oeis4.)