cp's OEIS Frontend

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.

A060430 Residue C(2^n,n) mod C(2^n,2).

This page as a plain text file.
%I A060430 #27 Aug 02 2025 09:58:41
%S A060430 0,0,0,20,0,1344,0,8160,0,349184,0,1397760,0,0,306774016,268431360,0,
%T A060430 7635468288,0,494779760640,942438088704,0,0,105553109975040,0,0,0,
%U A060430 6004799480791040,0,192153583922184192,0,576460752169205760,0,49191317527028826112,0
%N A060430 Residue C(2^n,n) mod C(2^n,2).
%H A060430 Chai Wah Wu, <a href="/A060430/b060430.txt">Table of n, a(n) for n = 1..1664</a> (terms 1..200 from Harry J. Smith)
%F A060430 a(n) = A014070(n) mod A006516(n).
%p A060430 for n from 1 to 60 do printf(`%d,`,binomial(2^n, n) mod binomial(2^n,2)) od:
%t A060430 Table[Mod[Binomial[2^n,n],Binomial[2^n,2]],{n,40}] (* _Harvey P. Dale_, Feb 11 2015 *)
%o A060430 (Python)
%o A060430 from math import comb
%o A060430 def A060430(n): return comb(m:=1<<n,n)%comb(m,2) # _Chai Wah Wu_, Aug 01 2025
%Y A060430 Cf. A014070, A006516.
%K A060430 easy,nonn
%O A060430 1,4
%A A060430 _Labos Elemer_, Apr 11 2001
%E A060430 More terms from _James Sellers_, Apr 12 2001
%E A060430 Offset corrected by _Harry J. Smith_, Jul 05 2009