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.

Showing 1-2 of 2 results.

A202337 Range of A062723.

Original entry on oeis.org

1, 2, 6, 12, 36, 108, 324, 972, 2916, 8748, 26244, 78732, 236196, 708588, 2125764, 6377292, 19131876, 57395628, 172186884, 516560652, 1549681956, 4649045868, 13947137604, 41841412812, 125524238436, 376572715308, 1129718145924, 3389154437772, 10167463313316
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 17 2011

Keywords

Comments

Subsequence of A000792.
Apparently a(n) = A052156(n - 1) for n >= 4. - Georg Fischer, Mar 26 2019

Crossrefs

Programs

  • Haskell
    a202337 n = a202337_list !! (n-1)
    a202337_list = f a062723_list where
       f (x:xs'@(x':xs)) = if x == x' then f xs' else x : f xs'

Formula

From Colin Barker, Mar 26 2019: (Start)
G.f.: x*(1 - x - 6*x^3) / (1 - 3*x).
a(n) = 4*3^(n-3) for n>3.
a(n) = 3*a(n-1) for n>4.
(End)

A167371 Triangle, read by rows, given by [0,1,-1,0,0,0,0,0,0,0,0,...] DELTA [1,0,-1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1
Offset: 0

Views

Author

Philippe Deléham, Nov 02 2009

Keywords

Comments

Diagonal sums: A060576.
A167374*A154325 formatted as lower triangular matrix. - Philippe Deléham, Nov 19 2009

Examples

			Triangle begins:
  1;
  0, 1;
  0, 1, 1;
  0, 0, 1, 1;
  0, 0, 0, 1, 1;
  0, 0, 0, 0, 1, 1; ...
		

Crossrefs

Formula

Sum_{k=0..n} T(n,k)*x^k = A000007(n), A046698(n+1), A111286(n+1), A027327(n) for x= 0, 1, 2, 3 respectively.
G.f.: (1+x^2*y)/(1-x*y). - Philippe Deléham, Nov 09 2013
T(n,k) = T(n-1,k-1) for n > 2, T(0,0) = T(1,1) = T(2,1) = T(2,2) = 1, T(1,0) = T(2,0) = 0, T(n,k) = 0 if k < 0 or if k > n. - Philippe Deléham, Nov 09 2013
Showing 1-2 of 2 results.