31497

Appears in sequences

• Number of ways to tile a 5 X n region with square tiles of size up to 5 X 5.at n=8A054857
• a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.at n=9A064457
• a(1)=a(2)=1; thereafter, a(n+1) = a(n) + a(n-1) + 1 if n is a multiple of 5, otherwise a(n+1) = a(n) + a(n-1).at n=22A124502
• Number of base 17 n-digit numbers with adjacent digits differing by one or less.at n=8A126371
• Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares less than n*12/3.at n=32A183929
• Number of n X 8 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=15A188865
• Number of tilings of an 8 X n rectangle using integer-sided square tiles.at n=5A219927