|
| |
|
|
A087633
|
|
Number of n-digit primes == 9 (mod 10). E.g. there exist 5 two-digit prime numbers(19,29,59,79 and 89) with unit's place 9.
|
|
0
| | |
|
|
|
OFFSET
| 0,2
|
|
|
EXAMPLE
| E.g. a(3)=33, since there are 33 three-digit numbers with unit place digit as 9.
|
|
|
PROG
| (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==9) count=count+1; } c=0; } System.out.println("count = "+count);
|
|
|
CROSSREFS
| Sequence in context: A199552 A061253 A111530 * A135075 A049377 A129890
Adjacent sequences: A087630 A087631 A087632 * A087634 A087635 A087636
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Meenakshi Srikanth and Amarnath Murthy (menakan_s(AT)yahoo.com), Sep 15 2003
|
|
|
EXTENSIONS
| Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 04 2003
|
| |
|
|