|
|
A158464
|
|
Number of distinct squares in row n of Pascal's triangle.
|
|
1
|
|
|
1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
It seems that some subset of terms in A055997 (A115599) gives the positions of 3's. E.g., we have a(9) = a(50) = a(289) = a(9801) = 3, but on the other hand, a(1682) = a(57122) = 2. - Antti Karttunen, Nov 03 2017
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(8) = #{1} = 1;
a(9) = #{1,9,36} = 3.
|
|
MAPLE
|
local sqset, k ;
sqset := {} ;
for k from 0 to n do
P := binomial(n, k) ;
if issqr(P) then
sqset := sqset union {P} ;
end if;
end do:
nops(sqset) ;
end proc:
|
|
MATHEMATICA
|
CountDistinct /@ Table[Sqrt@ Binomial[n, k] /. k_ /; ! IntegerQ@ k -> Nothing, {n, 0, 104}, {k, 0, n}] (* Michael De Vlieger, Nov 03 2017 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|