1,1

An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1<i2, j1<j2 and these elements are in the same relative order as those in the triple (x,y,z). In general, the number of m X n 0-1 matrices in question is given by (n+1)*2^(m-1)+2*(n-1).

Also, temperatures in Fahrenheit that convert to Celsius as nonnegative multiples of 10. - J. Lowell, Jul 28 2007

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

Tanya Khovanova, Recursive Sequences.

S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.

Index entries for linear recurrences with constant coefficients, signature (2,-1).

a(n) = 18*n + 14.

a(n) = 2*A017245(n).

From Elmo R. Oliveira, Jul 01 2025: (Start)

G.f.: 2*x*(16-7*x)/(1-x)^2.

E.g.f.: 2*(exp(x)*(9*x + 7) - 7).

a(n) = 2*a(n-1) - a(n-2) for n > 2. (End)

Table[18n + 14, {n, 52}] (* Robert G. Wilson v, Nov 16 2004 *)

(Magma) [18*n+14: n in [1..60]]; // Vincenzo Librandi, Jul 25 2011

Cf. A017245.

Sequence in context: A037008 A383732 A316943 * A176542 A346917 A343154

Adjacent sequences: A099045 A099046 A099047 * A099049 A099050 A099051

nonn,easy

Sergey Kitaev, Nov 13 2004

More terms from Robert G. Wilson v, Nov 16 2004

approved