19591

Appears in sequences

• a(n) = (8*n+1)*(8*n+7).at n=17A001533
• Number of ways of embedding a connected graph with n edges in the square lattice.at n=8A019988
• Palindromes of form k*(k+6).at n=4A028562
• Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=49A035538
• Numbers that are palindromic, divisible by 11 and have an odd number of digits.at n=16A045571
• Composite palindromes whose sum of prime factors is palindromic (counted with multiplicity).at n=30A046354
• Triangle T(n,k) of number of strongly connected digraphs on n unlabeled nodes and with k arcs, k=0..n*(n-1).at n=56A057276
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=4A070001
• Number of partitions of 2n in which each odd part has even multiplicity and each even part has odd multiplicity.at n=27A100847
• Numbers n such that n and pi(n) (A000720) are palindromic.at n=27A103357
• a(n) = binomial(n+5,6) + binomial(n+3,3) + binomial(n+2,3) + binomial(n-1,1).at n=13A105450
• a(n) = A130179(n)/81.at n=21A130085
• Number of partitions of n^2 into exactly 4 prime numbers.at n=31A243940
• Number of nX4 binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once.at n=4A268736
• Number of nX5 binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once.at n=3A268737
• T(n,k)=Number of nXk binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once.at n=31A268740
• T(n,k)=Number of nXk binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once.at n=32A268740
• Triangle read by rows: T(n,k) is the number of unlabeled strongly connected digraphs with n arcs and k vertices, n >= 0, k = 1..n+1.at n=71A350753
• Number of defective (binary) heaps on n elements from the set {0,1} where exactly n ancestor-successor pairs do not have the correct order.at n=19A372641