|
%I #22 Jun 27 2019 03:02:40
%S 2,3,4,5,7,8,9,11,12,13,14,16,17,18,19,22,23,24,25,26,27,29,30,31,32,
%T 33,34,37,38,39,40,41,42,43,44,46,47,48,49,50,51,52,53,54,57,58,59,60,
%U 61,62,63,64,65,67,68,69,71,72,73,74,75,76,77,79,80,81
%N Numbers occurring in just one row of Pascal's triangle.
%H Reinhard Zumkeller, <a href="/A185024/b185024.txt">Table of n, a(n) for n = 1..2500</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Singmaster's_conjecture">Singmaster's conjecture</a>
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F A059233(a(n)) = 1.
%F a(n) = A137905(n-1), n >= 2. - _Elijah Beregovsky_, May 14 2019
%o (Haskell)
%o import Data.List (elemIndices)
%o a185024 n = a185024_list !! (n-1)
%o a185024_list = map (+ 2 ) $ elemIndices 1 a059233_list
%Y Cf. A137905, A098565, A182237, A059233.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Dec 24 2012
|
