id:A046804 - OEIS Search Results

Search: id:A046804

Displaying 1-1 of 1 results found.

page 1

Primes p modulo t where t = terminal digit of p.

+0
1

0, 0, 0, 0, 0, 1, 3, 1, 2, 2, 0, 2, 0, 1, 5, 2, 5, 0, 4, 0, 1, 7, 2, 8, 6, 0, 1, 2, 1, 2, 1, 0, 4, 4, 5, 0, 3, 1, 6, 2, 8, 0, 0, 1, 1, 1, 0, 1, 3, 4, 2, 5, 0, 0, 5, 2, 8, 0, 4, 0, 1, 2, 6, 0, 1, 2, 0, 1, 4, 7, 2, 8, 3, 1, 1, 2, 2, 5, 0, 4, 5, 0, 0, 1, 7, 2, 8, 2, 0, 1, 5, 2, 4, 0, 4, 2, 5, 0, 1, 0, 1, 4, 2, 2, 0 (list; graph; listen)

	OFFSET	`1,7`
	REFERENCES	`Idea derived from "The Creation of New Mathematics: An Application of the Lakatos Heuristic," pp. 292-298 of Philip J. Davis and Reuben Hersh, The Mathematical Experience, Houghton Mifflin Co, 1982. ISBN 0-395-32131-X.`
	LINKS	`Index entries for sequences related to final digits of numbers`
	EXAMPLE	`If p = 29, then 29 - 27 = 2.`
	CROSSREFS	`Adjacent sequences: A046801 A046802 A046803 this_sequence A046805 A046806 A046807` `Sequence in context: A103514 A016570 A070773 this_sequence A056529 A087282 A105973`
	KEYWORD	`easy,nonn`
	AUTHOR	`Enoch Haga (Enokh(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.

AT&T Labs Research