This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A371471 #16 Jul 28 2025 03:03:05 %S A371471 0,6,84,796,5,3792,7,27768,22608,56440,11,83772,13,168448,61065, %T A371471 471536,17,445320,19,994080,2258235,4188272,23,6083208,156275,743912, %U A371471 13548492,3588928,29,16444800,31,28887008,13685133,2841992,42053795,49421088,37,24763840,9171162 %N A371471 a(n) = binomial(n^2,n) mod n^5. %D A371471 D. B. Fuks and Serge Tabachnikov, Mathematical Omnibus: Thirty Lectures on Classic Mathematics, American Mathematical Society, 2007. Lecture 2. Arithmetical Properties of Binomial Coefficients, pages 27-44. %H A371471 Chai Wah Wu, <a href="/A371471/b371471.txt">Table of n, a(n) for n = 1..10000</a> %F A371471 If p is prime and p>=5, a(p) = p. %t A371471 A371471[n_] := Mod[Binomial[n^2, n], n^5]; %t A371471 Array[A371471, 50] (* _Paolo Xausa_, Jul 28 2025 *) %o A371471 (PARI) a(n) = binomial(n^2, n)%n^5; %Y A371471 Cf. A014062, A081369. %K A371471 nonn %O A371471 1,2 %A A371471 _Seiichi Manyama_, Mar 24 2024