81390

Appears in sequences

• Number of n-step self-avoiding walks on cubic lattice.at n=7A001412
• Numbers whose base-5 representation has exactly 8 runs.at n=8A043608
• Number of length n+4 0..5 arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=3A254695
• 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=31A254698
• Number of length 4+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=4A254702
• Twice partitioned numbers where the first partition is constant and the latter partitions are strict.at n=49A279788
• Numbers k such that 427*2^k+1 is prime.at n=39A323114
• Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance 2w apart where the walk starts at the middle point between the planes.at n=27A338125