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.

A156294 Sum of products of the digits of prime numbers and the position of the digits in the prime numbers.

This page as a plain text file.
%I A156294 #11 Feb 11 2017 17:44:45
%S A156294 2,3,5,7,3,7,15,19,8,20,5,17,6,10,18,11,23,8,20,9,13,25,14,26,23,4,10,
%T A156294 22,28,12,26,10,28,34,36,14,32,22,34,24,42,20,22,28,40,46,7,15,27,33,
%U A156294 17,35,13,15,33,23,41,19,37,21,27,29,24,8,14,26,12,30,32,38,22,40,36,26,44
%N A156294 Sum of products of the digits of prime numbers and the position of the digits in the prime numbers.
%H A156294 Indranil Ghosh, <a href="/A156294/b156294.txt">Table of n, a(n) for n = 1..50000</a>
%F A156294 a(n) = A156207(prime(n)). - _R. J. Mathar_, Sep 10 2016
%e A156294 For n = 5, prime(5) = 11 and A156207(11) = 1*1 + 1*2 = 3. So, a(5) = 3. - _Indranil Ghosh_, Feb 11 2017
%t A156294 Table[Total[IntegerDigits[#] Range@ IntegerLength@ #] &@ Prime@ n, {n, 75}] (* _Michael De Vlieger_, Feb 11 2017 *)
%o A156294 (PARI) g(x) = local(v,j);v=Vec((Str(x))); sum(j=1, length(v), j*eval(v[j]))
%o A156294 g1(n) = local(j);forprime(j=1,n,print1(g(j)","))
%K A156294 base,nonn
%O A156294 1,1
%A A156294 _Cino Hilliard_, Feb 07 2009