23465

Appears in sequences

• Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=17A074348
• a(n) = n*(n+1)*(n+7)*(122+57*n+n^2)/120.at n=11A101862
• a(n) = 65*n^2.at n=18A165798
• Coefficient of x in the reduction of the n-th Fibonacci polynomial by x^3->x^2+1.at n=17A192782
• Number of partitions of n such that the absolute value of the difference between the number of odd parts and the number of even parts is <=1.at n=47A239835
• Number of partitions of n such that (greatest part) <= (multiplicity of least part).at n=48A240182
• Seventh partial sums of fourth powers (A000583).at n=5A254870
• Smallest Rhonda number to base b = n-th composite number, A002808(n).at n=39A255872
• p-INVERT of the positive integers, where p(S) = (1 - S)^5.at n=6A290920
• a(n) = Sum_{k=0..n} k^4*binomial(2*n-k,n).at n=6A302352
• Numbers whose prime factors counted with multiplicity satisfy: (maximum) - (minimum) = (mean).at n=21A362268
• a(n) is the side y of smallest possible length in triangles with integer sides corresponding to x=A375748(n).at n=48A375749