login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154272 1,0,1 followed by 0,0,0... 29
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

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

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

REFERENCES

I. Niven, Irrational Numbers, Math. Assoc. Am., John Wiley and Sons, New York, 2nd printing 1963.

LINKS

Table of n, a(n) for n=1..95.

J. H. Conway and S. P. Norton, Monstrous Moonshine, Bull. Lond. Math. Soc. 11 (1979) 308-339.

D. Ford, J. McKay and S. P. Norton, More on replicable functions, Comm. Algebra 22, No. 13, 5175-5193 (1994).

J. McKay and H. Strauss, The q-series of monstrous moonshine and the decomposition of the head characters, Comm. Algebra 18 (1990), no. 1, 253-278.

Franck Ramaharo, A generating polynomial for the pretzel knot, arXiv:1805.10680 [math.CO], 2018.

Index entries for McKay-Thompson series for Monster simple group

FORMULA

a(n) = (binomial(2*n,n) mod 2) + (binomial((n-1)^2,n+1) mod 2), with n>=1. - Paolo P. Lava, Jan 22 2009

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.

Dirichlet g.f. 1+1/3^s. - R. J. Mathar, Mar 12 2012

Euler transform of length 4 sequence [ 0, 1, 0, -1]. - Michael Somos, Aug 04 2009

G.f.: x + x^3 = x / (1 - x^2 / (1 + x^2)) = x * (1 - x^4) / (1 - x^2). - Michael Somos, Jan 03 2013

MATHEMATICA

PadRight[{1, 0, 1}, 150, 0] (* Harvey P. Dale, Jun 14 2017 *)

PROG

(PARI) {a(n) = (n==1) || (n==3)}; /* Michael Somos, Jan 03 2013 */

CROSSREFS

Cf. A154271, A154269, A000012, A000007, A019590.

Sequence in context: A072770 A071674 A090172 * A014061 A014053 A186719

Adjacent sequences:  A154269 A154270 A154271 * A154273 A154274 A154275

KEYWORD

nonn,mult,easy

AUTHOR

Mats Granvik, Jan 06 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 02:56 EST 2018. Contains 318087 sequences. (Running on oeis4.)