A174293 -id:A174293 - cp's OEIS frontend

A112467 Riordan array ((1-2x)/(1-x), x/(1-x)).

1, -1, 1, -1, 0, 1, -1, -1, 1, 1, -1, -2, 0, 2, 1, -1, -3, -2, 2, 3, 1, -1, -4, -5, 0, 5, 4, 1, -1, -5, -9, -5, 5, 9, 5, 1, -1, -6, -14, -14, 0, 14, 14, 6, 1, -1, -7, -20, -28, -14, 14, 28, 20, 7, 1, -1, -8, -27, -48, -42, 0, 42, 48, 27, 8, 1, -1, -9, -35, -75, -90, -42, 42, 90, 75, 35, 9, 1, -1, -10, -44, -110, -165, -132, 0, 132, 165, 110

Offset: 0

Paul Barry, Sep 06 2005

Row sums are A000007. Diagonal sums are -F(n-2). Inverse is A112468. T(2n,n)=0.
(-1,1)-Pascal triangle. - Philippe Deléham, Aug 07 2006
Apart from initial term, same as A008482. - Philippe Deléham, Nov 07 2006
Each column equals the cumulative sum of the previous column. - Mats Granvik, Mar 15 2010
Reading along antidiagonals generates in essence rows of A192174. - Paul Curtz, Oct 02 2011
Triangle T(n,k), read by rows, given by (-1,2,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938. - Philippe Deléham, Nov 01 2011

			Triangle starts:
    1;
   -1,  1;
   -1,  0,   1;
   -1, -1,   1,   1;
   -1, -2,   0,   2,   1;
   -1, -3,  -2,   2,   3,   1;
   -1, -4,  -5,   0,   5,   4,  1;
   -1, -5,  -9,  -5,   5,   9,  5,  1;
   -1, -6, -14, -14,   0,  14, 14,  6,  1;
   -1, -7, -20, -28, -14,  14, 28, 20,  7,  1;
   -1, -8, -27, -48, -42,   0, 42, 48, 27,  8, 1;
   -1, -9, -35, -75, -90, -42, 42, 90, 75, 35, 9, 1;
  ...
From _Paul Barry_, Apr 08 2011: (Start)
Production matrix begins:
   1,  1,
  -2, -1,  1,
   2,  0, -1,  1,
  -2,  0,  0, -1,  1,
   2,  0,  0,  0, -1,  1,
  -2,  0,  0,  0,  0, -1,  1,
   2,  0,  0,  0,  0,  0, -1,  1
  ... (End)

G. C. Greubel, Rows n = 0..100 of triangle, flattened
Elena Barcucci, Antonio Bernini, Stefano Bilotta, and Renzo Pinzani, Restricting Dyck Paths and 312-avoiding Permutations, arXiv:2307.02837 [math.CO], 2023. Mentions this sequence.
Paul Barry, A Note on Riordan Arrays with Catalan Halves, arXiv:1912.01124 [math.CO], 2019.
Emeric Deutsch, L. Ferrari and S. Rinaldi, Production Matrices, Advances in Mathematics, 34 (2005) pp. 101-122.
D. Foata and G.-N. Han, The doubloon polynomial triangle, Ram. J. 23 (2010), 107-126.
Jack Ramsay, On Arithmetical Triangles, The Pulse of Long Island, June 1965. [Mentions application to design of antenna arrays. Annotated scan.]

Same first 3 rows as in A054525.

Cf. A008482, A037012, A080232, A112466, A112467, A174293, A174294, A174295, A174296, A174297.

[n eq 0 select 1 else (2*k-n)*Binomial(n,k)/n: k in [0..n], n in [0..10]]; // G. C. Greubel, Dec 04 2019

seq(seq( `if`(n=0, 1, (2*k-n)*binomial(n,k)/n), k=0..n), n=0..10); # G. C. Greubel, Dec 04 2019

T[n_, k_]= If[n==0, 1, ((2*k-n)/n)*Binomial[n, k]]; Table[T[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* Roger L. Bagula, Feb 16 2009; modified by G. C. Greubel, Dec 04 2019 *)

T(n, k) = if(n==0, 1, (2*k-n)*binomial(n,k)/n ); \\ G. C. Greubel, Dec 04 2019

def T(n, k):
    if (n==0): return 1
    else: return (2*k-n)*binomial(n,k)/n
[[T(n, k) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Dec 04 2019

Number triangle T(n, k) = binomial(n, n-k) - 2*binomial(n-1, n-k-1).
Sum_{k=0..n} T(n, k)*x^k = (x-1)*(x+1)^(n-1). - Philippe Deléham, Oct 03 2005
T(n,k) = ((2*k-n)/n)*binomial(n, k), with T(0,0)=1. - Roger L. Bagula, Feb 16 2009; modified by G. C. Greubel, Dec 04 2019
T(n,k) = T(n-1,k-1) + T(n-1,k) with T(0,0)=1, T(1,0)=-1, T(n,k)=0 for k>n or for n<0. - Philippe Deléham, Nov 01 2011
G.f.: (1-2x)/(1-(1+y)*x). - Philippe Deléham, Dec 15 2011
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A133494(n), A081294(n), A005053(n), A067411(n), A199661(n), A083233(n) for x = 1, 2, 3, 4, 5, 6, 7, respectively. - Philippe Deléham, Dec 15 2011
exp(x) * e.g.f. for row n = e.g.f. for diagonal n. For example, for n = 3 we have exp(x)*(-1 - x + x^2/2! + x^3/3!) = -1 - 2*x - 2*x^2/2! + 5*x^4/4! + 14*x^5/5! + .... The same property holds more generally for Riordan arrays of the form ( f(x), x/(1 - x) ). - Peter Bala, Dec 21 2014
Sum_{k=0..n} T(n,k) = 0^n = A000007(n). - G. C. Greubel, Dec 04 2019

A118860 Numbers k such that k-1, k+1, 2k-1, 2k+1, 3k-1, 3k+1, 4k-1 and 4k+1 are all primes.

Original entry on oeis.org

21968100, 37674210, 81875220, 356467230, 416172330, 750662640, 1007393730, 1150070040, 1586271960, 1963954650, 3127171320, 3669568560, 4377895410, 4383541050, 5575083360, 5686935870, 5708418870, 7365234450, 7478474430, 7681046100, 8453862690, 8898688680

Offset: 1

Labos Elemer, May 03 2006

nonn

All terms are multiples of 210, hence simpler code is possible.

			21968100 is a term because 21968099, 21968101, 43936199, 43936201, 65904299, 65904301, 87872399, 87872401 are all prime.

Amiram Eldar, Table of n, a(n) for n = 1..100

Subsequence of A014574, A066388 and A118859.
Subsequence: A349321.
Cf. A174293, A348348.

tb={};Do[If[(PrimeQ[n-1]&&PrimeQ[n+1])&& (PrimeQ[2*n-1]&&PrimeQ[2*n+1])&& (PrimeQ[3*n-1]&&PrimeQ[3*n+1])&& (PrimeQ[4*n-1]&&PrimeQ[4*n+1]), Print[n];AppendTo[tb,n]], {n,21968100,10^8,210}];tb
Select[210*Range[424*10^5],AllTrue[{#-1,#+1,2#-1,2#+1,3#-1,3#+1,4#-1,4#+1},PrimeQ]&] (* Harvey P. Dale, Jul 23 2024 *)

isok(k) = if(k % 210, 0, for(i = 1, 4, forstep(j = -1, 1, 2, if(!isprime(i*k-j), return(0)))); 1); \\ Amiram Eldar, Mar 13 2025

a(n) = 210*A174293(n).

Edited by Don Reble, May 16 2006

a(20)-a(22) from Pontus von Brömssen, Oct 14 2021

cp's OEIS Frontend

A112467 Riordan array ((1-2x)/(1-x), x/(1-x)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula