cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-23 of 23 results.

A119852 Number of ternary words with exactly one 012.

Original entry on oeis.org

0, 0, 0, 1, 6, 27, 106, 387, 1350, 4566, 15102, 49113, 157622, 500520, 1575558, 4923536, 15290784, 47235771, 145246224, 444814533, 1357368786, 4128880561, 12523521786, 37888119522, 114358226428, 344437708131, 1035409733820
Offset: 0

Views

Author

Emeric Deutsch, May 26 2006

Keywords

Comments

Except for the initial three zeros, convolution of A076264 with itself. Column 1 of A119851.

Examples

			a(4)=6 because we have 0012, 0120, 0121, 0122, 1012 and 2012.
		

Crossrefs

Programs

  • Maple
    G:=z^3/(1-3*z+z^3)^2: Gser:=series(G,z=0,34): seq(coeff(Gser,z,n),n=0..30);
  • Mathematica
    CoefficientList[Series[z^3/(1-3z+z^3)^2,{z,0,30}],z] (* or *) LinearRecurrence[ {6,-9,-2,6,0,-1},{0,0,0,1,6,27},30] (* Harvey P. Dale, Apr 28 2014 *)

Formula

G.f.=z^3/(1-3z+z^2)^2.
a(0)=0, a(1)=0, a(2)=0, a(3)=1, a(4)=6, a(5)=27, a(n)=6*a(n-1)- 9*a(n-2)- 2*a(n-3)+6*a(n-4)-a(n-6). - Harvey P. Dale, Apr 28 2014

A123609 Quasiperiodic 9-gonal (nonagonal) sequence as a 1-dimensional tiling.

Original entry on oeis.org

4, 1, 2, 3, 4, 4, 3, 4, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 2, 3, 4, 1, 2, 3, 4, 3, 4, 2, 3, 4, 1, 2, 3, 4, 4, 3, 4, 2, 3, 4, 1, 2, 3, 4
Offset: 1

Views

Author

Gary W. Adamson and Roger L. Bagula, Oct 03 2006

Keywords

Comments

The frequency of each distinct term (1, 2, 3, or 4) tends to converge to the ratio of each diagonal (a, b, c, or d) to the sum of the 4 diagonal lengths. The four 9-gon (nonagon) diagonals are a=1, b=1.87938524..., c=2.53208888... and d=2.87938524..., with the sum a+b+c+d = d^2 = 8.29085936.... Converting these terms to fractions of the sum, a=0.12061475..., b=0.22668159..., c=0.30540728..., and d=0.34729635.... Through n = 45, we can thus expect sixteen 4's (correct), since round(45*.34729635...) = 16. The numbers of terms in each subset strung together is found in A006357: (1, 4, 10, 30, 85...), thus: (4), (1,2,3,4), (4,3,4,2,3,4,1,2,3,4), ..., while the distributive breakdown of numbers of 1's, 2's, 3's, and 4's may be found in the 4-termed set of vectors in A076264: 1 1 1 1 4 3 2 1 10 9 7 4 30 26 19 10 ... where the sum of 4 terms in a row = the left term in the next row. For example, the frequency distribution of 30 includes ten 4's, nine 3's, seven 2's, and four 1's. Check: the subset of 30 terms generated from the previous subset of 10: (1,2,3,4,2,3,4,1,2,3,4,3,4,2,3,4,1,2,3,4,4,3,4,2,3,4,1,2,3,4).
A fractal structure is suggested by parsing each subset into groups: (1,2,3,4), (2,3,4), (1,2,3,4), (3,4), (2,3,4), (1,2,3,4), (4), (3,4), (2,3,4), (1,2,3,4). That is, 10 groups: four with four terms, three with three terms, two with two terms, and one with one term. Replacing the terms (4,3,2,1) with the diagonal lengths (d,c,b,a) and referring to the set of vectors: (1,1,1,1; 4,3,2,1; 10,9,7,4; ...), label these rows 2,3,4,... and consider (2,3,4,...) exponents to diagonal d=2.87938524..., such that, for example, "4" corresponds to (10,9,7,4), and (Cf. Steinbach) d^4 = 68.738349... = (10*d + 9*c + 7*b + 4*a). Such relationships are a consequence of the "Diagonal Product Formulas" mentioned on p. 23.

Examples

			1=>4, then 4=>1,2,3,4, which, in turn, generates 4,3,4,2,3,4,1,2,3,4 (append next result to right of previous result, getting an infinite aperiodic sequence).
		

Crossrefs

Programs

  • Mathematica
    Drop[SubstitutionSystem[{1->{4},2->{3,4},3->{2,3,4},4->{1,2,3,4}},{1},{5}][[1]],5] (* Harvey P. Dale, Mar 02 2022 *)

Formula

Using the seed "1", we use the recurrence rules 1=>4; 2=>3,4; 3=>2,3,4; 4=>1,2,3,4; to form iterative subsets which are appended in succession to form a continuous string.

Extensions

Partially edited by Jon E. Schoenfield, Sep 15 2013

A123941 The (1,2)-entry in the 3 X 3 matrix M^n, where M = {{2, 1, 1}, {1, 1, 0}, {1, 0, 0}}.

Original entry on oeis.org

0, 1, 3, 9, 26, 75, 216, 622, 1791, 5157, 14849, 42756, 123111, 354484, 1020696, 2938977, 8462447, 24366645, 70160958, 202020427, 581694636, 1674922950, 4822748423, 13886550633, 39984728949, 115131438424, 331507764639, 954538564968, 2748484256480
Offset: 0

Views

Author

Roger L. Bagula and Gary W. Adamson, Oct 25 2006

Keywords

Comments

Essentially the same as A076264. - Tom Edgar, May 12 2015

References

  • Rosenblum and Rovnyak, Hardy Classes and Operator Theory, Dover, New York, 1985, page 26

Crossrefs

Programs

  • GAP
    a:=[0,1,3];; for n in [4..30] do a[n]:=3*a[n-1]-a[n-3]; od; a; # Muniru A Asiru, Oct 28 2018
    
  • Magma
    R:=PowerSeriesRing(Integers(), 30); [0] cat Coefficients(R!( x/(1-3*x+x^3) )); // G. C. Greubel, Aug 05 2019
    
  • Maple
    with(linalg): M[1]:=matrix(3,3,[2,1,1,1,1,0,1,0,0]): for n from 2 to 30 do M[n]:=multiply(M[1],M[n-1]) od: 0,seq(M[n][1,2], n=1..30);
    a[0]:=0: a[1]:=1: a[2]:=3: for n from 3 to 30 do a[n]:=3*a[n-1]-a[n-3] od: seq(a[n], n=0..30);
  • Mathematica
    M = {{2,1,1}, {1,1,0}, {1,0,0}}; v[1] = {0,0,1}; v[n_]:= v[n] =M.v[n-1];Table[v[n][[2]], {n, 30}]
    LinearRecurrence[{3,0,-1}, {0,1,3}, 30] (* G. C. Greubel, Aug 05 2019 *)
  • PARI
    my(x='x+O('x^30)); concat([0], Vec(x/(1-3*x+x^3))) \\ G. C. Greubel, Aug 05 2019
    
  • Sage
    (x/(1-3*x+x^3)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Aug 05 2019

Formula

a(n) = 3*a(n-1) - a(n-3), a(0)=0, a(1)=1, a(2)=3 (follows from the minimal polynomial x^3-3x^2+1 of the matrix M).
a(n) = A076264(n-1). - R. J. Mathar, Jun 18 2008
G.f.: x/(1 - 3*x + x^3). - Arkadiusz Wesolowski, Oct 29 2012
a(n) = A018919(n-2) for n >= 2. - Georg Fischer, Oct 28 2018

Extensions

Edited by N. J. A. Sloane, Nov 07 2006
Previous Showing 21-23 of 23 results.