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.

A228378 Numbers n such that tb(n) = tb(n+1) where tb(n) = A048784(n) is the number of divisors of binomial(2*n, n).

This page as a plain text file.
%I A228378 #11 Apr 15 2019 09:55:02
%S A228378 9,10,22,34,44,45,51,56,82,106,130,141,142,162,166,177,185,190,230,
%T A228378 262,273,274,320,322,346,352,354,394,440,454,470,526,536,550,562,586,
%U A228378 606,624,635,670,692,717,754,766,779,814,826,831,862,882,891,920,934
%N A228378 Numbers n such that tb(n) = tb(n+1) where tb(n) = A048784(n) is the number of divisors of binomial(2*n, n).
%H A228378 Charles R Greathouse IV, <a href="/A228378/b228378.txt">Table of n, a(n) for n = 1..2611</a>
%t A228378 SequencePosition[Table[DivisorSigma[0,Binomial[2n,n]],{n,1000}],{x_,x_}][[All,2]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Apr 15 2019 *)
%o A228378 (PARI) lista(nn) = my(last = 0); for (i=1, nn, new = numdiv(binomial(2*i,i)); if (last == new, print1(i, ", ")); last = new) \\ _Michel Marcus_, Aug 21 2013
%Y A228378 Cf. A000005, A000984.
%K A228378 nonn
%O A228378 1,1
%A A228378 _Michel Marcus_, Aug 21 2013