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.

A078489 a(n)=j such that binomial(n,j)

This page as a plain text file.
%I A078489 #5 Apr 30 2014 01:31:15
%S A078489 2,2,3,4,4,5,6,6,7,7,8,9,9,10,10,11,12,12,13,14,14,15,15,16,17,17,18,
%T A078489 19,19,20,20,21,22,22,23,23,24,25,25,26,27,27,28,28,29,30,30,31,32,32,
%U A078489 33,33,34,35,35,36,36,37,38,38,39,40,40,41,41,42,43,43,44,44,45,46,46,47
%N A078489 a(n)=j such that binomial(n,j)<binomial(n-1,j-2).
%C A078489 Related to Ramanujan's tau function
%F A078489 Conjecture: a(n) = A003258(n) - n + 1. - _Ralf Stephan_, Feb 24 2004
%e A078489 a(3)=3, as: binomial(3,0)=1 and binomial(2,-2)=0 binomial(3,1)=3 and binomial(2,-1)=0 binomial(3,2)=3 and binomial(2,0)=1 binomial(3,3)=1 and binomial(2,1)=2
%o A078489 (PARI) for (n=1,100,j=0; while (binomial(n,j)>binomial(n-1,j-2),j++); print1(j","))
%K A078489 nonn
%O A078489 1,1
%A A078489 _Jon Perry_, Jan 04 2003