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.

This page as a plain text file.
%I A265127 #13 Sep 08 2022 08:46:14
%S A265127 4,12,40,112,352,832,2176,4864,11776,29696,63488,151552,335872,704512,
%T A265127 1540096,3473408,7733248,15990784,35127296,74448896,153092096,
%U A265127 331350016,696254464,1493172224,3254779904,6777995264,13824425984,28722593792,58518929408,121332826112
%N A265127 a(n) = prime(n) * 2^n.
%F A265127 a(n) = A000079(n) * A000040(n).
%e A265127 a(1) = 4 because prime(1) * 2^1 = 2 * 2 = 4.
%t A265127 Array[Prime@# 2^# &, {30}] (* _Michael De Vlieger_, Dec 02 2015 *)
%o A265127 (PARI) a(n) = prime(n) * 2^n;
%o A265127 (Magma) [NthPrime(n)*2^n: n in [1..30]]; // _Vincenzo Librandi_, Dec 03 2015
%Y A265127 Cf. A000040, A000079.
%Y A265127 Equals twice A110295. - _David Radcliffe_, Dec 03 2015
%K A265127 nonn,easy
%O A265127 1,1
%A A265127 _Altug Alkan_, Dec 02 2015