28799
domain: N
Appears in sequences
- Numerators of continued fraction convergents to sqrt(119).at n=7A041216
- Numerators of continued fraction convergents to sqrt(476).at n=7A041908
- The sum of the non-divisors of n (less than n) is a multiple of the sum of the divisors of n.at n=21A066860
- Numbers n such that n!! + 2 is prime.at n=22A076185
- Numbers k such that sum of the divisors d of k divides 1 + 2 + ... + k = k(k+1)/2.at n=23A076617
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=36A077441
- (Product of twin primes - 1)/2.at n=16A120876
- Triangle T(n,k) = 2*binomial(n,k)^2 - 1, read by rows, 0<=k<=n.at n=58A141597
- Triangle T(n,k) = 2*binomial(n,k)^2 - 1, read by rows, 0<=k<=n.at n=62A141597
- a(n) = n^3 - n^2 - n.at n=31A152015
- a(n) = 29282*n^2 - 484*n + 1.at n=0A157610
- a(n) = 18*n^2 - 1.at n=39A157910
- a(n) = 50*n^2 - 1.at n=23A157919
- a(n) = 900*n - 1.at n=31A158409
- a(n) = 32*n^2 - 1.at n=29A158563
- a(n) = 72*n^2 - 1.at n=19A158738
- T(n,k) = 12*A046802(n,k) - 9*A008518(n,k) - 2*A007318(n,k), triangle read by rows (0 <= k <= n).at n=31A168293
- T(n,k) = 12*A046802(n,k) - 9*A008518(n,k) - 2*A007318(n,k), triangle read by rows (0 <= k <= n).at n=32A168293
- Numbers k such that 17 is the largest prime factor of k^2 - 1.at n=41A181452
- Numbers n such that n' = p^2-1, with n = semiprime = p*q, n' is the arithmetic derivative of n. Also: semiprimes of the form p*(p^2-p-1).at n=6A190274