cp's OEIS Frontend

A154272 1,0,1 followed by 0,0,0,...

%I A154272 #65 May 05 2025 22:23:21
%S A154272 1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A154272 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A154272 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A154272 1,0,1 followed by 0,0,0,...
%C A154272 Dirichlet inverse of this sequence is A154271. There is progression of sequences starting with A000007, A019590 and then this sequence A154272. From A019590 onwards the Dirichlet inverse of such sequences appears to be positive as often as negative. Except for the first term, the all 1's sequence A000012, is a union of the 1's in sequences A000007, A019590, A154272 etc. It therefore in a sense seems likely that the Moebius function is positive as often as negative because the Dirichlet inverse of A000012 is the Moebius function A008683. However the whole is more than the sum of its parts and the likelihood of the signs of the Moebius function cannot be inferred.
%C A154272 With offset -1, this is the replicable function number 1a. The generating function A(x) = 1/x + x is the first modular "fiction". This is a completely 2-replicable function. The g.f. A(x) satisfies 0 = f(A(x), A(x^2)) where f(u, v) = v + 2 - u^2. Similarly the replicable function number 2b gives the sequence 1,0,-1,0,0,0,0,0,... - _Michael Somos_, Aug 04 2009
%C A154272 The g.f. x+x^3 equals x*Phi(4,x), where Phi are the cyclotomic polynomials. The series reversion of y=x+x^3 is x = y - y^3 + 3*y^5 - 12*y^7 + 55*y^9 - ..., which is a signed variant of A001764. - _R. J. Mathar_, Sep 29 2012
%D A154272 I. Niven, Irrational Numbers, Math. Assoc. Am., John Wiley and Sons, New York, 2nd printing 1963.
%H A154272 Paul Barry, <a href="https://arxiv.org/abs/2104.01644">Centered polygon numbers, heptagons and nonagons, and the Robbins numbers</a>, arXiv:2104.01644 [math.CO], 2021.
%H A154272 J. H. Conway and S. P. Norton, <a href="https://doi.org/10.1112/blms/11.3.308">Monstrous Moonshine</a>, Bull. Lond. Math. Soc. 11 (1979) 308-339.
%H A154272 D. Ford, J. McKay and S. P. Norton, <a href="http://dx.doi.org/10.1080/00927879408825127">More on replicable functions</a>, Comm. Algebra 22, No. 13, 5175-5193 (1994).
%H A154272 J. McKay and H. Strauss, <a href="http://dx.doi.org/10.1080/00927879008823911">The q-series of monstrous moonshine and the decomposition of the head characters</a>, Comm. Algebra 18 (1990), no. 1, 253-278.
%H A154272 Franck Ramaharo, <a href="https://arxiv.org/abs/1805.10680">A generating polynomial for the pretzel knot</a>, arXiv:1805.10680 [math.CO], 2018.
%H A154272 <a href="/index/Mat#McKay_Thompson">Index entries for McKay-Thompson series for Monster simple group</a>
%F A154272 a(n)=1 if m(n) = 1/sin(Pi/(2*n)) is a natural number, and 0 otherwise. m(1)=1 and m(3)=2. See the quoted I. Niven book, Corollary 3.12, p.41. - _Wolfdieter Lang_, Dec 17 2010
%F A154272 Dirichlet g.f. 1+1/3^s. - _R. J. Mathar_, Mar 12 2012
%F A154272 Euler transform of length 4 sequence [ 0, 1, 0, -1]. - _Michael Somos_, Aug 04 2009
%F A154272 G.f.: x + x^3 = x / (1 - x^2 / (1 + x^2)) = x * (1 - x^4) / (1 - x^2). - _Michael Somos_, Jan 03 2013
%F A154272 a(n) = Sum_{d|n} mu(n/d) * tau(gcd(d,3)). - _Ridouane Oudra_, Apr 28 2025
%F A154272 a(n) = (Sum_{d|n} mu(n/d) * gcd(d,3)) / phi(n). - _Ridouane Oudra_, Apr 30 2025
%t A154272 PadRight[{1,0,1},150,0] (* _Harvey P. Dale_, Jun 14 2017 *)
%o A154272 (PARI) {a(n) = (n==1) || (n==3)}; /* _Michael Somos_, Jan 03 2013 */
%Y A154272 Cf. A154271, A154269, A000012, A000007, A019590, A008683.
%K A154272 nonn,mult,easy
%O A154272 1,1
%A A154272 _Mats Granvik_, Jan 06 2009