|
Search: id:A060289
|
|
|
| A060289 |
|
Number of distinct (non-overlapping) twin Harshad numbers whose sum is prime and where the 2nd Harshad is <= 10^n. |
|
+0
3
|
| |
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
Generate the twin Harshads whose sum is prime. Count how many there are where the 2nd Harshad in the pair is <= a consecutive power of 10.
|
|
EXAMPLE
|
a(0)=4 because there are four pairs of Harshads whose sum is prime and the 2nd Harshad in the pair is <=10; these are 1+2=3, 3+4=7, 5+6=11, 9+10=19. 8+9=17 is not included because this pair overlaps 7+8=15, which also happens to be not prime. (Another sequence might include such overlapping pairs.)
|
|
CROSSREFS
|
A060288, A005349, A060159.
Sequence in context: A061806 A119997 A010361 this_sequence A066879 A134750 A051949
Adjacent sequences: A060286 A060287 A060288 this_sequence A060290 A060291 A060292
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 23 2001
|
|
|
Search completed in 0.002 seconds
|
