28215

Appears in sequences

• Odd primitive abundant numbers.at n=38A006038
• Least m such that n = m mod tau(m) if such m exists, otherwise 0.at n=22A066708
• Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=21A097647
• Odd infinitary abundant numbers.at n=16A127666
• Least number k having n representations as the sum of the minimal number of biquadrates A002377(k).at n=19A185673
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=36A188439
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 4,4,5,0,0,5,1 for x=0,1,2,3,4,5,6.at n=8A197659
• Equals two maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..2 nX3 array.at n=4A220317
• T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..2 nXk array.at n=23A220319
• T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..2 nXk array.at n=25A220319
• Members of a pair (m,k) such that sigma(m) = sigma(k) = sigma(m+k), m < k where sigma = A000203.at n=11A239436
• Members of a pair (m,n) such that sigma(m) = sigma(n) = sigma(n-m), m < n where sigma = A000203.at n=22A239939
• Number of partitions p of n such that the number of numbers having multiplicity 1 in p is not a part and the number of numbers having multiplicity > 1 is a part.at n=47A241415
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=35A247317
• Number of length n+1 0..2 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=8A250271
• T(n,k)=Number of length n+1 0..k arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=53A250277
• Number of levels in all bargraphs having semiperimeter n (n>=2). A level in a bargraph is a maximal sequence of two or more adjacent horizontal steps; it is preceded and followed by either an up step or a down step.at n=10A273345
• Number of forests of labeled rooted trees of height at most 1, with n labels, two of which are used for root nodes and any root may contain >= 1 labels.at n=9A273652
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=18A293186
• Least odd primitive abundant number having its prime signature.at n=9A316116