cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A265127 a(n) = prime(n) * 2^n.

Original entry on oeis.org

4, 12, 40, 112, 352, 832, 2176, 4864, 11776, 29696, 63488, 151552, 335872, 704512, 1540096, 3473408, 7733248, 15990784, 35127296, 74448896, 153092096, 331350016, 696254464, 1493172224, 3254779904, 6777995264, 13824425984, 28722593792, 58518929408, 121332826112
Offset: 1

Views

Author

Altug Alkan, Dec 02 2015

Keywords

Examples

			a(1) = 4 because prime(1) * 2^1 = 2 * 2 = 4.
		

Crossrefs

Equals twice A110295. - David Radcliffe, Dec 03 2015

Programs

  • Magma
    [NthPrime(n)*2^n: n in [1..30]]; // Vincenzo Librandi, Dec 03 2015
  • Mathematica
    Array[Prime@# 2^# &, {30}] (* Michael De Vlieger, Dec 02 2015 *)
  • PARI
    a(n) = prime(n) * 2^n;
    

Formula

a(n) = A000079(n) * A000040(n).