335923

Appears in sequences

• a(n) = (6^n - 1)/5.at n=8A003464
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 6.at n=37A022170
• Gaussian binomial coefficients [ n,7 ] for q = 6.at n=1A022225
• Numbers that are repdigits in base 6.at n=36A048331
• a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.at n=6A053717
• Numbers of the form (6^{mr}-1)/(6^r-1) for positive integers m, r.at n=16A076285
• a(n) = (-1)^(n+1)*6*(36^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.at n=4A090646
• 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=28A096040
• Modulo 2 binomial transform of 6^n.at n=7A100309
• Triangle read by rows: T(n,k) = value of the n-th repunit in base (k+1) representation, 1<=k<=n.at n=32A125118
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 5, read by rows.at n=37A157156
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 5, read by rows.at n=43A157156
• Composite numbers k for which k - phi(k) divides k-1.at n=32A160599
• 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=37A166973
• Sum n^k, k=0..n+1.at n=5A173468
• 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=21A229437
• 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=27A229437
• 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=7A329018
• a(n) = floor(A026532(n)/5).at n=16A329114
• a(n) = floor(A026549(n)/5).at n=16A329115