|
%I #26 Dec 12 2023 08:24:59
%S 0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,
%T 1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,
%U 1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1
%N Characteristic function of numbers relatively prime to 11.
%C The x-powers appearing in the numerator polynomial of the o.g.f., given below, give the numbers from 0,1,...,10 which survive the sieve of Eratosthenes for multiples of 11, namely 1,2,...10.
%C Contribution from _Reinhard Zumkeller_, Nov 30 2009: (Start)
%C a(n)=A000007(A010880(n)); a(A160542(n))=1; a(A008593(n))=0;
%C A033443(n) = SUM(a(k)*(n-k): 0<=k<=n). (End)
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F a(n)=1 if gcd(n,11)=1, else 0. Periodic with period 11: a(n+11)=a(11).
%F O.g.f.: x*sum(x^k,k=0..9)/(1-x^11).
%F Completely multiplicative with a(p) = (if p=11 then 0 else 1), p prime. [From _Reinhard Zumkeller_, Nov 30 2009]
%F Dirichlet g.f. (1-11^(-s))*zeta(s). - R. J. Mathar, Mar 06 2011
%F For the general case: the characteristic function of numbers that are not multiples of m is a(n)=floor((n-1)/m)-floor(n/m)+1, m,n > 0. - _Boris Putievskiy_, May 08 2013
%t LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},105] (* _Ray Chandler_, Aug 26 2015 *)
%o (PARI) a(n)=gcd(n,11)==1 \\ _Charles R Greathouse IV_, Jun 28 2015
%Y A000035, A011655, A011558, A109720 for coprimality with 2,3,5,7, respectively.
%Y Cf. A168185, A168184, A168182, A168181, A097325, A166486.
%K nonn,mult,easy
%O 0,1
%A _Wolfdieter Lang_ Feb 05 2009
|
