id:A072971 - OEIS Search Results

Search: id:A072971

Displaying 1-1 of 1 results found.

page 1

Least k such the last digit of prime(n+k) = last digit of prime(n) in base 10.

+0
1

3, 6, 3, 5, 2, 5, 7, 2, 3, 5, 2, 4, 5, 5, 2, 6, 6, 2, 2, 4, 5, 3, 6, 3, 3, 5, 8, 2, 4, 4, 1, 6, 6, 2, 2, 6, 4, 5, 1, 4, 4, 4, 4, 6, 3, 6, 2, 5, 5, 1, 4, 4, 5, 13, 2, 4, 4, 1, 3, 3, 3, 6, 2, 12, 1, 4, 2, 3, 3, 5, 2, 2, 8, 3, 10, 3, 1, 4, 1, 6, 2, 2, 4, 5, 3, 5, 6, 2, 3, 8, 4, 2, 3, 7, 2, 4, 5, 1, 4, 5, 5, 5, 1 (list; graph; listen)

	OFFSET	`4,1`
	COMMENT	`Is the sequence of integers b(m) such that S(b(m))>4b(m) finite? ( S(n) = sum(k=4,n,a(k)) ) 3 first terms are : b(1)=794 b(2)=795 b(3)= 1326. Is -4 <= 4n-S(n) <= 13 always true? Is a(n) bounded?`
	FORMULA	`Probably lim n -> infinity S(n)/n = sum(k=4, n, a(k) )/n = 4`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, k=1; while(abs(prime(k+n)%10-prime(n)%10)>0, k++); k)`
	CROSSREFS	`Adjacent sequences: A072968 A072969 A072970 this_sequence A072972 A072973 A072974` `Sequence in context: A074274 A111461 A111762 this_sequence A134548 A124860 A038138`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 13 2002`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research