%I A097468
%S A097468 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,
%T A097468 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,
%U A097468 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
%N A097468 Number of 1's in the decimal expansion of the lesser of twin primes.
%C A097468 n=5000,d=1 in PARI code below.
%e A097468 11 is the third lesser twin prime so 2 is the third entry
%o A097468 (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) }
%Y A097468 Sequence in context: A141095 A159195 A099313 this_sequence A098381 A030372 
               A065363
%Y A097468 Adjacent sequences: A097465 A097466 A097467 this_sequence A097469 A097470 
               A097471
%K A097468 base,nonn
%O A097468 2,3
%A A097468 Cino Hilliard (hillcino368(AT)gmail.com), Aug 23 2004