cp's OEIS Frontend

17^a(n) is largest power of 17 dividing (17^n)!.

Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=17, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n)=det(A). - Milan Janjic, Feb 21 2010

Partial sums of powers of 19 (A001029); q-integers for q=19: diagonal k=1 in triangle A022183.

Partial sums are in A014903. Also, the sequence is related to A014936 by A014936(n) = n*a(n)-sum(a(i), i=0..n-1) for n>0. - Bruno Berselli, Nov 06 2012

Partial sums of powers of 20 (A009964), q-integers for q=20: diagonal k=1 in triangle A022184.

Partial sums are in A014904. Also, the sequence is related to A014937 by A014937(n) = n*a(n)-Sum_{i=0..n-1} a(i), for n>0. - Bruno Berselli, Nov 06 2012

For n >= 1, a(n) is the total number of holes in a certain box fractal (start with 20 boxes, 1 hole) after n iterations. See illustration in links. - Kival Ngaokrajang, Jan 28 2015

Primes in this sequence are given in A006033.

Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=15, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n)=det(A). - Milan Janjic, Feb 21 2010

Partial sums are in A014898. Also, the sequence is related to A014930 by A014930(n) = n*a(n) - Sum_{i=1..n-1}( a(i) ). - Bruno Berselli, Nov 06 2012

The number -2 can be used as a base of numeration (see the Weisstein link). - Alonso del Arte, Mar 30 2014

Contribution from M. F. Hasler, Oct 21 2014: (Start)

This is the inverse binomial transform of A033999 = n->(-1)^n, and the binomial transform of A033999*A000244 = n->(-3)^n, see also A141413.

Prefixed with one 0, i.e., (0,1,-2,4,...) = -A033999*A131577, it is the binomial transform of (0, 1, -4, 13, -40, 121,...) = -A033999*A003462, and inverse binomial transform of (0,1,0,1,0,1,...) = A000035.

Prefixed with two 0's, i.e., (0,0,1,-2,4,-8,...), it is the binomial transform of (0,0,1,-5,18,-58,179,-543,...) (cf. A000340) and inverse binomial transform of (0,0,1,1,2,2,3,3,...) = A004526. (End)

Prefixed with three 0's, this is the inverse binomial difference of (0, 0, 0, 1, 2, 4, 6, 9, 12, 16,...) = concat(0, A002620), which has as successive differences (0, 0, 1, 1, 2, 2,...) = A004526, then (0, 1, 0, 1,...) = A000035, then (1, -1, 1, -1,...) = A033999, and then (-2)^k*A033999 with k=1,2,3,... - Paul Curtz, Oct 16 2014, edited by M. F. Hasler, Oct 21 2014

Stirling-Bernoulli transform of triangular numbers: 1, 3, 6, 10, 15, 21, 28, ... - Philippe Deléham, May 25 2015

Primes are given in A006032.

Let A be the Hessenberg matrix of the order n, defined by: A[1,j]=1, A[i,i]:=14, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n)=det(A). - Milan Janjic, Feb 21 2010

For the difference equation a(n) = c*a(n-1) - d*a(n-2), with a(0) = 0, a(1) = 1, the solution is a(n) = d^((n-1)/2) * ChebyshevU(n-1, c/(2*sqrt(d))) and has the alternate form a(n) = ( ((c + sqrt(c^2 - 4*d))/2)^n - ((c - sqrt(c^2 - 4*d))/2)^n )/sqrt(c^2 - 4*d). In the case c^2 = 4*d then the solution is a(n) = n*d^((n-1)/2). The generating function is x/(1 - c*x + d^2) and the exponential generating function takes the form (2/sqrt(c^2 - 4*d))*exp(c*x/2)*sinh(sqrt(c^2 - 4*d)*x/2) for c^2 > 4*d, (2/sqrt(4*d - c^2))*exp(c*x/2)*sin(sqrt(4*d - c^2)*x/2) for 4*d > c^2, and x*exp(sqrt(d)*x) if c^2 = 4*d. - G. C. Greubel, Jun 10 2022

Partial sums of powers of 21 (A009965); q-integers for q=21: diagonal k=1 in triangle A022185.

Partial sums are in A014905. Also, the sequence is related to A014938 by A014938(n) = n*a(n) - Sum_{i=0..n-1} a(i) for n > 0. - Bruno Berselli, Nov 06 2012

For n >= 1, 4*a(n) is the total number of holes in a certain box fractal (start with 21 boxes, 4 holes) after n iterations. See illustration in links. - Kival Ngaokrajang, Jan 27 2015

Partial sums of powers of 31 (A009975).

Also the number of 2-block covers of a labeled n-set. a(n) = A055154(n,2). Generally, number of k-block covers of a labeled n-set is T(n,k) = (1/k!)*Sum_{i = 1..k + 1} Stirling1(k + 1,i)*(2^(i - 1) - 1)^n. In particular, T(n,2) = (1/2!)*(3^n - 3), T(n,3) = (1/3!)*(7^n - 6*3^n + 11), T(n,4) = (1/4)!*(15^n - 10*7^n + 35*3^n - 50), ... - Vladeta Jovovic, Jan 19 2001

Conjectured to be the number of integers from 0 to 10^(n-1) - 1 that lack 0, 1, 2, 3, 4, 5 and 6 as a digit. - Alexandre Wajnberg, Apr 25 2005. This is easily verified to be true. - Renzo Benedetti, Sep 25 2008

Number of monic irreducible polynomials of degree 1 in GF(3)[x1,...,xn]. - Max Alekseyev, Jan 23 2006

Also, the greatest number of identical weights among which an odd one can be identified and it can be decided if the odd one is heavier or lighter, using n weighings with a comparing balance. If the odd one only needs to be identified, the sequence starts 4, 13, 40 and is A003462 (3^n - 1)/2, n > 1. - Tanya Khovanova, Dec 11 2006; corrected by Samuel E. Rhoads, Apr 18 2016

Binomial transform yields A134057. Inverse binomial transform yields A062510 with one additional 0 in front. - R. J. Mathar, Jun 18 2008

Numbers k where the recurrence s(0)=0, if s(k-1) >= k then s(k) = s(k-1) - k otherwise s(k) = s(k-1) + k produces s(k) = 0. - Hugo Pfoertner, Jan 05 2012

For n > 1: A008344(a(n)) = a(n). - Reinhard Zumkeller, May 09 2012

Also the number of edges in the (n-1)-Hanoi graph. - Eric W. Weisstein, Jun 18 2017

A level 1 Sierpiński triangle graph is a triangle. Level n+1 is formed from three copies of level n by identifying pairs of corner vertices of each pair of triangles. a(n) is the number of degree 4 vertices in the level n Sierpinski triangle graph. - Allan Bickle, Jul 30 2020

Also the number of minimum vertex cuts in the n-Apollonian network. - Eric W. Weisstein, Dec 20 2020

Also the minimum number of turns in n-dimensional Euclidean space needed to visit all 3^n points of the grid {0, 1, 2}^n, moving in straight lines between turns (repeated visits and direction changes at non-grid points are allowed). - Marco Ripà, Aug 06 2025