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!)
A100738 Inverse modulo 2 binomial transform of 5^n. 1

%I #3 Mar 30 2012 18:59:02

%S 1,4,24,96,624,2496,14976,59904,390624,1562496,9374976,37499904,

%T 243749376,974997504,5849985024,23399940096,152587890624,610351562496,

%U 3662109374976,14648437499904,95214843749376,380859374997504

%N Inverse modulo 2 binomial transform of 5^n.

%C 5^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100738(k)}.

%F a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)5^k}.

%K easy,nonn

%O 0,2

%A _Paul Barry_, Dec 06 2004

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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)