The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A100739 Inverse modulo 2 binomial transform of 6^n. 1
1, 5, 35, 175, 1295, 6475, 45325, 226625, 1679615, 8398075, 58786525, 293932625, 2175101425, 10875507125, 76128549875, 380642749375, 2821109907455, 14105549537275, 98738846760925, 493694233804625, 3653337330154225 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
6^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100739(k)}.
LINKS
FORMULA
a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)6^k}.
CROSSREFS
Sequence in context: A124793 A048515 A219973 * A329762 A359520 A043014
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 06 2004
STATUS
approved

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 May 15 21:22 EDT 2024. Contains 372549 sequences. (Running on oeis4.)