|
Search: id:A087630
|
|
|
| A087630 |
|
Number of n-digit primes == 1 (mod 10). E.g. there exist 5 two-digit prime numbers (11,31,41,61 and 71) with unit's place 1. |
|
+0
1
|
|
| 0, 5, 35, 266, 2081, 17230, 146487, 1274194, 11271088, 101050133
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
a(3)=35, since there are 35 three-digit numbers with unit place digit as 1.
|
|
PROGRAM
|
(JAVA) The terms of the sequences are generated by changing the range for j for the various number of digits. E.g. it ranges from 100 to 999 for three-digit numbers. float r, x; int c=0, count=0; for (float j=100f; j<1000f; j++) { for (float i=2f; i<j; i++) { r=j%i; if (r==0) c=1; } if (c == 0) { x=j%10; if (x==1) count=count+1; } c=0; } System.out.println("count = "+count);
|
|
CROSSREFS
|
Sequence in context: A091928 A155127 A104532 this_sequence A084135 A138233 A002294
Adjacent sequences: A087627 A087628 A087629 this_sequence A087631 A087632 A087633
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Meenakshi Srikanth and Amarnath Murthy (menakan_s(AT)yahoo.com), Sep 15 2003
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 04 2003
|
|
|
Search completed in 0.002 seconds
|
