The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068037 Number of subsets of {1,2,3,...,n} that sum to 0 mod 16. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS FORMULA Conjecture: 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] CROSSREFS 16th row of A068009. Sequence in context: A281904 A007679 A239870 * A167188 A295720 A296152 Adjacent sequences:  A068034 A068035 A068036 * A068038 A068039 A068040 KEYWORD nonn AUTHOR Antti Karttunen, Feb 11 2002 STATUS approved

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

Last modified May 24 23:45 EDT 2020. Contains 334581 sequences. (Running on oeis4.)