login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046804 Primes p modulo t where t = terminal digit of p. 0
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; refs; listen; history; internal format)
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

Sequence in context: A103514 A016570 A070773 * A056529 A087282 A105973

Adjacent sequences:  A046801 A046802 A046803 * A046805 A046806 A046807

KEYWORD

nonn,base,easy

AUTHOR

Enoch Haga (Enokh(AT)comcast.net)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.