28917

Appears in sequences

• Augmented amicable pairs (larger member of each pair).at n=2A015630
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 20.at n=16A031698
• Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=30A046320
• a(n) = concatenation of n^2 and n.at n=16A055436
• a(n) = 100*n^2 + n.at n=16A055438
• Antidiagonal sums of square array A082011.at n=20A082014
• a(n) = T(n)^2 - n^2, where T(n) is a triangular number.at n=18A085740
• L-th order palindromes with L > 2.at n=28A089381
• Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=36A124141
• First differences of A140495.at n=38A142716
• a(n) = 289*n^2 + 17.at n=10A158585
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 637", based on the 5-celled von Neumann neighborhood.at n=28A273306
• Variation on betrothed numbers.at n=5A281265
• Array read by antidiagonals: T(m,n) = number of (undirected) paths in the grid graph P_m X P_n.at n=30A288518
• Array read by antidiagonals: T(m,n) = number of (undirected) paths in the grid graph P_m X P_n.at n=33A288518
• Number of (undirected) paths in the grid graph P_3 X P_n.at n=5A288527
• Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=7A299384
• a(n) is the index of the first occurrence of n in A331284.at n=25A331285
• Numbers that are the sum of four third powers in seven or more ways.at n=15A345150
• Numbers that are the sum of four third powers in exactly seven ways.at n=13A345151