login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249664 In the n-th row of Pascal's triangle, an odious entry is replaced by 1, an evil entry is replaced by 0 and the n-th row is converted to decimal. 1

%I #12 Nov 14 2014 13:11:15

%S 1,3,7,9,27,33,65,255,511,585,1025,3591,4617,13611,32639,34401,109675,

%T 147441,264833,923271,1183241,3620667,7178459,11295285,25104893,

%U 57717819,102148931,168533253,403441155,712644501,1221813641,4029305871,8397439583,9813933129

%N In the n-th row of Pascal's triangle, an odious entry is replaced by 1, an evil entry is replaced by 0 and the n-th row is converted to decimal.

%H Peter J. C. Moses, <a href="/A249664/b249664.txt">Table of n, a(n) for n = 0..500</a>

%F a(n) = sum {i=0,...,n} A010060(binomial(n,i)))*2^i.

%t a10060[n_] := If[OddQ[Count[IntegerDigits[n, 2], 1]], 1, 0];

%t Table[Sum[a10060[Binomial[n, i]]2^i, {i, 0, n}], {n, 0, 50}]

%Y Cf. A007318, A010060.

%K nonn,base

%O 0,2

%A _Vladimir Shevelev_, Nov 03 2014

%E More terms from _Peter J. C. Moses_, Nov 03 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 16 11:30 EDT 2024. Contains 375174 sequences. (Running on oeis4.)