25052

Appears in sequences

• a(n) = T(n, n-4), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.at n=10A026557
• Even palindromes in which parity of digits alternates.at n=35A030149
• a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,2,2.at n=17A049868
• Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=16A072435
• Palindromic even numbers with exactly 3 prime factors (counted with multiplicity).at n=38A075816
• Palindromes k such that 3k + 1 is also a palindrome.at n=24A083829
• Indices of primes in sequence defined by A(0) = 27, A(n) = 10*A(n-1) - 13 for n > 0.at n=16A101962
• Partial sums of A120769.at n=45A120770
• Palindromic cyclops numbers.at n=23A138131
• Antidiagonal sums of triangle A186084.at n=38A186505
• Number of ways to arrange 5 indistinguishable points on an n X n square grid so that no three points are collinear at any angle.at n=4A194190
• Square array read by antidiagonals downwards: T(n,k) = number of ways to arrange k indistinguishable points on an n X n square grid so that no three points are collinear at any angle.at n=40A194193
• Number of (n+2) X (1+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 2 3 4 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 2 3 4 6 or 7.at n=12A252271
• Partial sums of A092183.at n=3A302559
• a(n) is the least nonnegative number that can be represented as the sum of two (not necessarily distinct) generalized pentagonal numbers in exactly n ways.at n=10A381535