50609

Appears in sequences

• a(n) = (10n+1)*(10n+9).at n=22A001535
• Numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=39A020700
• Quasi-Carmichael numbers to base 9: squarefree composites n such that (n,2*3*5*7) = 1 and prime p|n ==> p-9|n-9.at n=8A029554
• Numbers n such that A048767(n+1)=A048767(n).at n=31A048769
• Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).at n=33A075654
• Ordered product of the sides of primitive Pythagorean triangles divided by 60.at n=35A081752
• Primitive elements of A065607.at n=24A120692
• a(n) = n^4 - n - 1.at n=14A126423
• a(n) = 29 + 73*n + 37*n^2.at n=36A145980
• Number of length 2+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=15A249708
• a(n) gives the odd leg of the second of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the larger of the two possible odd legs.at n=21A253804
• Greatest integer whose square root is less than or equal to Sum_{j=0..n} sqrt(j).at n=48A338277