290521

Appears in sequences

• Numbers of the form 7^i*11^j.at n=23A003599
• Number of perfect matchings in graph C_{12} X P_{n}.at n=4A028483
• Odd squares in which parity of digits alternates.at n=28A030156
• Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=29A057290
• Squares with property that digits alternate in parity individually as well as in concatenation with previous terms.at n=20A068888
• Solutions to mod(sigma(x), 6) = 5.at n=13A074384
• Triangle read by rows: T(n,k) is the number of partitions of binomial(n,k) into parts of the first n rows of Pascal's triangle, 0<=k<=n.at n=40A132311
• Perfect squares in A133459; or perfect squares that are the sums of two nonzero pentagonal pyramidal numbers.at n=27A136359
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, 0), (1, -1, 1), (1, 1, -1)}.at n=11A148434
• Numbers which can be expressed as the product of numbers made of only sevens.at n=22A161145
• Number of (n+1)X(1+1) 0..2 arrays with nondecreasing maximum of every two consecutive values in every row and column.at n=5A250613
• Number of (n+1)X(6+1) 0..2 arrays with nondecreasing maximum of every two consecutive values in every row and column.at n=0A250618
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing maximum of every two consecutive values in every row and column.at n=15A250620
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing maximum of every two consecutive values in every row and column.at n=20A250620
• Number of perfect matchings in the P_4 X C_n graph.at n=9A252054
• Square numbers of the form prime(k) + 2*prime(k+1).at n=20A284057
• a(n) is the first occurrence of n in A334200.at n=26A334199