The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067112 Let N = 2357111317192329313741434753..., the concatenation of the primes; a(n) = sum of first n digits of N. 9
 0, 2, 5, 10, 17, 18, 19, 20, 23, 24, 31, 32, 41, 43, 46, 48, 57, 60, 61, 64, 71, 75, 76, 80, 83, 87, 94, 99, 102, 107, 116, 122, 123, 129, 136, 143, 144, 151, 154, 161, 170, 178, 181, 189, 198, 207, 214, 215, 215, 216, 217, 217, 220, 221, 221, 228, 229, 229, 238, 239 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Zak Seidov, Table of n, a(n) for n = 0..1000 EXAMPLE a(5) = 2+3+5+7+1 = 18. MATHEMATICA s=0; ss={0}; Do[id=IntegerDigits[Prime[k]]; Do[AppendTo[ss, s=s+id[[i]]], {i, Length[id]}], {k, 100}]; ss (* Zak Seidov, Jan 23 2015 *) PROG (PARI) {s=0; print1(0", "); for(k=1, 100, id=digits(prime(k)); for(i=1, # id, print1(s=s+id[i]", ")))} \\ Zak Seidov, Jan 24 2015 CROSSREFS Sequence in context: A258601 A264300 A326763 * A101306 A051351 A111925 Adjacent sequences:  A067109 A067110 A067111 * A067113 A067114 A067115 KEYWORD easy,nonn,base AUTHOR Amarnath Murthy, Jan 08 2002 EXTENSIONS More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 01 2003 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 January 17 09:54 EST 2020. Contains 330949 sequences. (Running on oeis4.)