The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A156294 Sum of products of the digits of prime numbers and the position of the digits in the prime numbers. 1
 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, 22, 28, 12, 26, 10, 28, 34, 36, 14, 32, 22, 34, 24, 42, 20, 22, 28, 40, 46, 7, 15, 27, 33, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Indranil Ghosh, Table of n, a(n) for n = 1..50000 FORMULA a(n) = A156207(prime(n)). - R. J. Mathar, Sep 10 2016 EXAMPLE For n = 5, prime(5) = 11 and A156207(11) = 1*1 + 1*2 = 3. So, a(5) = 3. - Indranil Ghosh, Feb 11 2017 MATHEMATICA Table[Total[IntegerDigits[#] Range@ IntegerLength@ #] &@ Prime@ n, {n, 75}] (* Michael De Vlieger, Feb 11 2017 *) PROG (PARI) g(x) = local(v, j); v=Vec((Str(x))); sum(j=1, length(v), j*eval(v[j])) g1(n) = local(j); forprime(j=1, n, print1(g(j)", ")) CROSSREFS Sequence in context: A239037 A126050 A163821 * A126607 A124322 A209037 Adjacent sequences:  A156291 A156292 A156293 * A156295 A156296 A156297 KEYWORD base,nonn AUTHOR Cino Hilliard, Feb 07 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 14:18 EST 2021. Contains 349596 sequences. (Running on oeis4.)