33048

Appears in sequences

• Number of 6-ary Lyndon words of length n with trace 1 and subtrace 0 over Z_6.at n=8A074428
• Number of 6-ary Lyndon words of length n with trace 1 and subtrace 2 over Z_6.at n=8A074430
• Number of 6-ary Lyndon words of length n with trace 1 and subtrace 4 over Z_6.at n=8A074432
• Number of 6-ary Lyndon words of length n with trace 2 and subtrace 0 over Z_6.at n=8A074434
• Number of 6-ary Lyndon words of length n with trace 2 and subtrace 2 over Z_6.at n=8A074436
• Number of 6-ary Lyndon words of length n with trace 2 and subtrace 4 over Z_6.at n=8A074438
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=38A076673
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=38A076675
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=36A076676
• Number of 3 X 3 semimagic squares with distinct positive values and magic sum n.at n=17A173547
• Number of 2-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=17A187163
• Numbers with prime factorization pq^3r^5.at n=17A190011
• Positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.at n=8A235941
• Number of length n+4 0..7 arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=1A254697
• T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=29A254698
• Number of length 2+4 0..n arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=6A254700
• Number of length n 1..(6+1) arrays with every leading partial sum divisible by 2 or 3.at n=6A257060
• Number of length 7 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.at n=5A257069
• a(n) = 2*n^3 + 9*n^2 + 9*n.at n=24A303609
• Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h x 2h x 2h where the walk starts at the center of one of the box's faces.at n=38A337031