Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Jan 06 2013 11:52:25
%S 4,4,5,4,6,4,4,6,5,4,6,4,4,4,6,4,4,6,6,4,4,4,4,6,4,4,6,4,6,4,4,4,4,4,
%T 6,4,5,4,4,4,6,4,6,4,4,4,4,6,4
%N Number of occurrences of n as an entry in rows <= 2n of Losanitsch's triangle (A034851).
%C For n = 1 to 1000, the only values of a(n) are 4, 5, 6, 8, 10 and infinity.
%e a(4) = 5 because 4 occurs five times in Losanitsch's triangle: the first time at row 4, column 2, being the sum of the two 2's in the row above; and at column 1 of rows 7 and 8, which are symmetrically duplicated at row 7, column 6 and row 8, column 7.
%t (* The following assumes a[n, k] has already been defined to give Losanitsch's triangle; see for example the program given for A153046 *)
%t tallyLozOccs[1] := Infinity; tallyLozOccs[n_Integer?Positive] := Module[{i, searchMax, tally}, i = 0; searchMax = 2n; tally = 0; While[i <= searchMax, tally = tally + Length[Select[Table[a[i, m], {m, 0, i}], # == n &]]; i++ ]; Return[tally]]; Table[tallyLozOccs[n], {n, 2, 50}]
%t (* this program also assumes a(n,k) has been defined for Losanitsch's triangle*)
%t Table[Length[Select[Flatten[Table[a[i,m], {i,0,2n}, {m,0,i}]],#==n&]], {n,2,50}] (* Wilfredo Lopez (chakotay147138274(AT)yahoo.com), Mar 18 2009 *)
%Y Cf. A003016, Number of occurrences of n as an entry in rows <= n of Pascal's triangle.
%K easy,nonn
%O 2,1
%A _Alonso del Arte_, Mar 12 2009