A008726 -id:A008726 - cp's OEIS frontend

A118729 Rectangular array where row r contains the 8 numbers 4r^2 - 3r, 4r^2 - 2r, ..., 4r^2 + 4r.

0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 27, 30, 33, 36, 39, 42, 45, 48, 52, 56, 60, 64, 68, 72, 76, 80, 85, 90, 95, 100, 105, 110, 115, 120, 126, 132, 138, 144, 150, 156, 162, 168

Offset: 0

Stuart M. Ellerstein (ellerstein(AT)aol.com), May 21 2006

The numbers in row r span the interval ]8*A000217(r-1), 8*A000217(r)].
The first difference between the entries in row r is r.
Partial sums of floor(n/8). - Philippe Deléham, Mar 26 2013
Apart from the initial zeros, the same as A008726. - Philippe Deléham, Mar 28 2013
a(n+7) is the number of key presses required to type a word of n letters, all different, on a keypad with 8 keys where 1 press of a key is some letter, 2 presses is some other letter, etc., and under an optimal mapping of letters to keys and presses (answering LeetCode problem 3014). - Christopher J. Thomas, Feb 16 2024

			The array starts, with row r=0, as
  r=0:   0  0  0  0  0  0  0  0;
  r=1:   1  2  3  4  5  6  7  8;
  r=2:  10 12 14 16 18 20 22 24;
  r=3:  27 30 33 36 39 42 45 48;

G. C. Greubel, Table of n, a(n) for n = 0..1000
LeetCode, 3014. Minimum Number of Pushes to Type Word I.
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,1,-2,1).

Cf. similar sequences: A000217, A002620, A130518, A130519, A130520, A174709, A174738, A218470, A131242.

Flatten[Table[4r^2+r(Range[-3,4]),{r,0,6}]] (* or *) LinearRecurrence[ {2,-1,0,0,0,0,0,1,-2,1},{0,0,0,0,0,0,0,0,1,2},60] (* Harvey P. Dale, Nov 26 2015 *)

From Philippe Deléham, Mar 26 2013: (Start)
a(8k)   = A001107(k).
a(8k+1) = A002939(k).
a(8k+2) = A033991(k).
a(8k+3) = A016742(k).
a(8k+4) = A007742(k).
a(8k+5) = A002943(k).
a(8k+6) = A033954(k).
a(8k+7) = A033996(k). (End)
G.f.: x^8/((1-x)^2*(1-x^8)). - Philippe Deléham, Mar 28 2013
a(n) = floor(n/8)*(n-3-4*floor(n/8)). - Ridouane Oudra, Jun 04 2019
a(n+7) = (1/2)*(n+(n mod 8))*(floor(n/8)+1). - Christopher J. Thomas, Feb 13 2024

Redefined as a rectangular tabf array and description simplified by R. J. Mathar, Oct 20 2010

A008728 Molien series for 3-dimensional group [2,n ] = *22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 217, 224, 231, 238

Offset: 0

N. J. A. Sloane

a(n) = A179052(n) for n < 100. - Reinhard Zumkeller, Jun 27 2010

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 193
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2, -1, 0, 0, 0, 0, 0, 0, 0, 1, -2, 1).

Cf. A001840, A001972, A008724, A008725, A008726, A008727, A008732.

a:=[1,2,3,4,5,6,7,8,9,10,12,14];; for n in [13..70] do a[n]:=2*a[n-1]-a[n-2]+a[n-10]-2*a[n-11]+a[n-12]; od; a; # G. C. Greubel, Jul 30 2019

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^10)) )); // G. C. Greubel, Jul 30 2019

g:= 1/((1-x)^2*(1-x^10)); gser:= series(g, x=0,72); seq(coeff(gser, x, n), n=0..70); # modified by G. C. Greubel, Jul 30 2019

CoefficientList[Series[1/((1-x)^2(1-x^10)), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)

my(x='x+O('x^70)); Vec(1/((1-x)^2*(1-x^10))) \\ G. C. Greubel, Jul 30 2019

(1/((1-x)^2*(1-x^10))).series(x, 70).coefficients(x, sparse=False) # G. C. Greubel, Jul 30 2019

G.f.: 1/((1-x)^2*(1-x^10)).
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+10} floor(j/10).
a(n-10) = (1/2)*floor(n/10)*(2*n - 8 - 10*floor(n/10)). (End)

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

A008727 Molien series for 3-dimensional group [2,n] = *22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 196, 203, 210, 217, 224, 231, 238, 245, 252

Offset: 0

N. J. A. Sloane

Number of partitions of n into two kinds of 1's and one kind of 9. - Joerg Arndt, Dec 27 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 192
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,0,1,-2,1).

Cf. A001840, A001972, A008724, A008725, A008726, A008732. - Vladimir Joseph Stephan Orlovsky, Mar 14 2010

a:=[1,2,3,4,5,6,7,8,9,11,13];; for n in [12..70] do a[n]:=2*a[n-1]-a[n-2]+a[n-9]-2*a[n-10]+a[n-11]; od; a; # G. C. Greubel, Sep 09 2019

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^9)) )); // G. C. Greubel, Sep 09 2019

seq(coeff(series(1/((1-x)^2*(1-x^9)), x, n+1), x, n), n = 0..70); # G. C. Greubel, Sep 09 2019

Drop[Accumulate[Floor[Range[70]/9]], 8] (* Jean-François Alcover, Mar 27 2013 *)
CoefficientList[Series[1/(1-x)^2/(1-x^9), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)
LinearRecurrence[{2,-1,0,0,0,0,0,0,1,-2,1},{1,2,3,4,5,6,7,8,9,11,13},120] (* Harvey P. Dale, Feb 13 2022 *)

Vec(1/(1-x)^2/(1-x^9)+O(x^66)) /* Joerg Arndt, Mar 27 2013 */

def A008727_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(1/((1-x)^2*(1-x^9))).list()
A008727_list(70) # G. C. Greubel, Sep 09 2019

G.f.: 1/((1-x)^2*(1-x^9)).
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+9} floor(j/9).
a(n-9) = (1/2)*floor(n/9)*(2*n - 7 - 9*floor(n/9)). (End)

A008730 Molien series 1/((1-x)^2(1-x^12)) for 3-dimensional group [2,n] = 22n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 186, 192, 198, 204

Offset: 0

N. J. A. Sloane

			..1....2....3....4....5....6....7....8....9...10...11...12
.14...16...18...20...22...24...26...28...30...32...34...36
.39...42...45...48...51...54...57...60...63...66...69...72
.76...80...84...88...92...96..100..104..108..112..116..120
125..130..135..140..145..150..155..160..165..170..175..180
186..192..198..204..210..216..222..228..234..240..246..252
259..266..273..280..287..294..301..308..315..322..329..336
344..352..360..368..376..384..392..400..408..416..424..432
441..450..459..468..477..486..495..504..513..522..531..540
550..560..570..580..590..600..610..620..630..640..650..660
...
The columns are: A051866, A139267, A094159, A033579, A049452, A033581, A049453, A033580, A195319, A202804, A211014, A049598
- _Philippe Deléham_, Apr 03 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 195
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (2, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 1).

Cf. A001840, A001972, A008724, A008725, A008726, A008727, A008728, A008729, A008732. - Vladimir Joseph Stephan Orlovsky, Mar 14 2010

Cf. A221912

R:=PowerSeriesRing(Integers(), 70); Coefficients(R!( 1/((1-x)^2*(1-x^12)) )); // G. C. Greubel, Jul 30 2019

seq(coeff(series(1/(1-x)^2/(1-x^12), x, n+1), x, n), n=0..80);

CoefficientList[Series[1/((1-x)^2*(1-x^12)), {x,0,70}], x] (* Vincenzo Librandi, Jun 11 2013 *)
LinearRecurrence[{2,-1,0,0,0,0,0,0,0,0,0,1,-2,1},{1,2,3,4,5,6,7,8,9,10,11,12,14,16},70] (* Harvey P. Dale, Jan 01 2024 *)

my(x='x+O('x^70)); Vec(1/((1-x)^2*(1-x^12))) \\ G. C. Greubel, Jul 30 2019

(1/((1-x)^2*(1-x^12))).series(x, 70).coefficients(x, sparse=False) # G. C. Greubel, Jul 30 2019

G.f. 1/( (1-x)^3 * (1+x) *(1+x+x^2) *(1-x+x^2) * (1+x^2) *(1-x^2+x^4)). - R. J. Mathar, Aug 11 2021
From Mitch Harris, Sep 08 2008: (Start)
a(n) = Sum_{j=0..n+12} floor(j/12).
a(n-12) = (1/2)*floor(n/12)*(2*n - 10 - 12*floor(n/12)). (End)
a(n) = A221912(n+12). - Philippe Deléham, Apr 03 2013

More terms from Vladimir Joseph Stephan Orlovsky, Mar 14 2010

cp's OEIS Frontend

A118729 Rectangular array where row r contains the 8 numbers 4*r^2 - 3*r, 4*r^2 - 2*r, ..., 4*r^2 + 4*r.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A008728 Molien series for 3-dimensional group [2,n ] = *22n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A008727 Molien series for 3-dimensional group [2,n] = *22n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A008730 Molien series 1/((1-x)^2*(1-x^12)) for 3-dimensional group [2,n] = *22n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A118729 Rectangular array where row r contains the 8 numbers 4r^2 - 3r, 4r^2 - 2r, ..., 4r^2 + 4r.

A008730 Molien series 1/((1-x)^2(1-x^12)) for 3-dimensional group [2,n] = 22n.