26572

Appears in sequences

• Every run of digits of n in base 3 has length 2.at n=30A033001
• Base-9 palindromes that start with 4.at n=24A043031
• Triangle read by rows: T(n,k) is number of labeled bipartite graphs with n nodes and k edges.at n=35A117279
• Primitive numbers n such that 1/n is in the Cantor set.at n=31A173793
• Irregular triangle in which row n has primitive numbers k such that 1/k is in the Cantor set and the fraction 1/k has period n.at n=26A173800
• Partial sums of round(3^n/10).at n=11A177881
• T(n,k) = Number of permutations of 1..n+2*k-1 with each element displaced by at least k.at n=38A183244
• Number of permutations of 1..2*n+2 with each element displaced by at least n.at n=6A183245
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, six or eight distinct values for every i,j,k<=n.at n=7A211589
• Palindromic numbers in bases 3 and 9 written in base 10.at n=52A259386
• Expansion of Product_{k>=1} 1/((1-x^(3*k-1))*(1-x^(3*k-2)))^k.at n=31A262883
• Number of sequences of 5 throws of an n-sided die (with faces numbered 1, 2, ..., n) in which the sum of the throws first reaches or exceeds n on the 5th throw.at n=12A264750
• Expansion of e.g.f.: exp(exp(x) - 4*x - 1).at n=8A346739
• a(n) = n*(3*n^4 + 15*n^3 + 25*n^2 - 15*n - 28)/60.at n=13A365373
• Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3*n new points on the other three sides: sequence gives number of regions in the resulting planar graph.at n=8A367278
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n*k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=46A367304