18837

Appears in sequences

• A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-6), n >= 7.at n=22A001635
• Odd 10-gonal (or decagonal) numbers.at n=34A028993
• Number of partitions of 2*n into minimal numbers.at n=43A099385
• 10-gonal numbers for which the sum of the digits is also a 10-gonal number.at n=10A119547
• Numbers k such that the central binomial coefficient C(2k,k) is divisible by k^2.at n=33A121943
• Numbers of the form 68+p^2 (where p is a prime).at n=32A138691
• Odd long legs `B` of more than one primitive Pythagorean triangle.at n=33A179271
• The number of ways to linearly order the cycles in each permutation of {1,2,...,n} where two cycles are considered identical if they have the same length.at n=7A196301
• Pairs of deficient numbers having the same value of sigma(k)/k in the order that they are found.at n=11A211680
• The larger companion to the deficient numbers in A212608.at n=5A212609
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every element equal to some horizontal or antidiagonal neighbor, with top left element zero.at n=36A232316
• Number of (1+1)X(n+1) 0..1 arrays with every element equal to some horizontal or antidiagonal neighbor, with top left element zero.at n=8A232317
• Let s denote the sum of the deficient numbers in the aliquot parts of x. Sequence lists numbers x such that sigma(s) = usigma(x), where usigma(x) is the sum of the unitary divisors of x (A034448).at n=9A258134
• Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001001.at n=6A260242
• Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001001.at n=1A260247
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001001.at n=29A260248
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001001.at n=34A260248
• Number of sequences of 5 throws of an n-sided die (with faces numbered 1, 2, ..., n) in which the sum of the throws first reaches or exceeds n on the 5th throw.at n=11A264750
• Numbers m having greatest prime power divisor d such that d is smaller than the difference between m and the largest prime smaller than m.at n=35A290203
• Odd composites for which gcd(A325977(n), A325978(n)) is equal to abs(A325977(n)).at n=6A325981