46709

Appears in sequences

• Numbers k such that k^10 == 1 (mod 11^4).at n=33A056094
• a(0)=0, a(1)=1; thereafter a(n) = ceiling((3/2)^(n-3)*n*(n-1)).at n=16A120414
• Number of base 5 circular n-digit numbers with adjacent digits differing by 3 or less.at n=7A124999
• Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows, the sequence represents the number of terms a(i,k-i) in the expansion of the bivariate divided difference [u_0,...,u_i; v_0,...,v_{k-i}]y in terms of trivariate divided differences of g.at n=23A172003
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having the same number of equal edges, and new values 0..2 introduced in row major order.at n=6A205468
• Number of (n+1)X8 0..2 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..2 introduced in row major order.at n=0A205474
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..2 introduced in row major order.at n=21A205475
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..2 introduced in row major order.at n=27A205475
• Number of (n+1)X8 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.at n=0A205752
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.at n=21A205753
• Minimal number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).at n=23A217106
• Number of partitions of 2n such that (sum of parts having multiplicity 1) = sum of all other parts.at n=32A240447
• First differences of A255071.at n=18A255069
• Array read by antidiagonals: T(m,n) = number of m-ary words of length n with cyclically adjacent elements differing by 3 or less.at n=37A285281
• a(n) = Sum_{k=1..n} k^gcd(k,n).at n=5A342389