cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A068037 Number of subsets of {1,2,3,...,n} that sum to 0 mod 16.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 4, 9, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648
Offset: 0

Views

Author

Antti Karttunen, Feb 11 2002

Keywords

Crossrefs

16th row of A068009.

Formula

a(n) = 2^(-4+n) for n>7. G.f.: (2*x^8 -x^7 -2*x^6 +x^5 +x^4 +x^3 +x^2 +x -1) / (2*x -1). - Colin Barker, Dec 22 2012