2015539

Appears in sequences

• a(n) = (6^n - 1)/5.at n=9A003464
• Gaussian binomial coefficients [ n,8 ] for q = 6.at n=1A022226
• Numbers that are repdigits in base 6.at n=41A048331
• Numbers of the form (6^{mr}-1)/(6^r-1) for positive integers m, r.at n=20A076285
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^6-M)/5, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=36A096040
• a(n) = Sum_{j=0..8} n^j.at n=6A102909
• Triangle read by rows: T(n,k) = value of the n-th repunit in base (k+1) representation, 1<=k<=n.at n=40A125118
• Values of repunits with odd length L in base (L+3)/2 representation.at n=4A125119
• Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (5*k - 4)*(m*k - (m - 1))*T(n - 1, k) where m = 0.at n=46A166973
• T(n,k)=Number of nXk 0..6 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..2 array.at n=28A229437
• a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3/2) as in A328644.at n=8A329018
• a(n) = floor(A026532(n)/5).at n=18A329114
• a(n) = floor(A026549(n)/5).at n=18A329115