|
Search: id:A097468
|
|
|
| A097468 |
|
Number of 1's in the decimal expansion of the lesser of twin primes. |
|
+0
1
|
|
| 0, 0, 2, 1, 0, 1, 0, 1, 2, 1, 1, 1, 1, 2, 1, 0, 0, 0, 1, 2, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 2, 2, 1, 2, 2, 3, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 0, 1, 0, 3, 1, 2, 0, 0, 0, 0, 1, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 2, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
COMMENT
|
n=5000,d=1 in Pari code below.
|
|
EXAMPLE
|
11 is the third lesser twin prime so 2 is the third entry
|
|
PROGRAM
|
(PARI) g(n, d) = forprime(x=1, n, if(isprime(x+2), print1(countchr(x, d)", "))) \Count the occurrences of char in string str countchr(str, char) = { local(ln, x, c); str=Str(str); \This allows leaving quotes off input char=Str(char); c=0; ln=length(str); for(x=1, ln, if(mid(str, x, 1)==char, c++); ); return(c) } \ Get a substring of length n from string str starting at position s in str. mid(str, s, n) = { local(v, ln, x, tmp); v =""; tmp = Vec(str); ln=length(tmp); for(x=s, s+n-1, v=concat(v, tmp[x]); ); return(v) }
|
|
CROSSREFS
|
Adjacent sequences: A097465 A097466 A097467 this_sequence A097469 A097470 A097471
Sequence in context: A050317 A141095 A099313 this_sequence A098381 A030372 A065363
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Aug 23 2004
|
|
|
Search completed in 0.002 seconds
|
