id:A097944 - OEIS Search Results

Search: id:A097944

Displaying 1-1 of 1 results found.

page 1

Number of digits in n-th prime.

+0
1

1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`For primes p <= n sum(a(n)) -> n/2 and n-> inf.`
	EXAMPLE	`The first 4 primes are 2,3,5,7. These are 1 digit numbers so the first 4 entries in the table are 1's.`
	PROGRAM	`(PARI) g(n) = s=0; forprime(x=2, n, y=length(Str(x)); print1(y", "); s+=y); print(); print(s)`
	CROSSREFS	`Sequence in context: A069926 A077429 A060417 this_sequence A037203 A032556 A110592` `Adjacent sequences: A097941 A097942 A097943 this_sequence A097945 A097946 A097947`
	KEYWORD	`nonn,base`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Sep 05 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research