19435

Appears in sequences

• a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=41A014813
• Rhonda numbers to base 10.at n=12A099542
• a(n) = n*(2*n^2 + 5*n + 13)/2.at n=26A163655
• Number of binary strings of length n with equal numbers of 00000 and 10101 substrings.at n=15A164189
• Number of nX4 0..1 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=4A231511
• Number of nX5 0..1 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=3A231512
• T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=31A231515
• T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=32A231515
• For any number n > 0, let f(n) be the polynomial of a single indeterminate x where the coefficient of x^e is the prime(1+e)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the polynomials of a single indeterminate x with nonnegative integer coefficients; let g be the inverse of f; a(n) = g(f(n)^2).at n=32A297473
• Number of subsets of {1, 2, ..., n} such that the sum of the reciprocals is strictly less than 1.at n=17A305442
• Number of nonnegative integer square matrices with sum of entries equal to n, no zero rows or columns, and the same row sums as column sums.at n=7A321732
• Number of integer partitions of n whose multiplicities appear with distinct multiplicities that cover an initial interval of positive integers.at n=51A325331
• a(n) = (n^3+5*n+3)/3 + 2*floor(n/2) + a(n-2), with a(0)=1 and a(1)=3.at n=25A336529
• Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.at n=39A363729
• Numbers k such that sigma(k) = psi(k) + tau(k)^2.at n=26A390296