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.
%I A206558 #22 Dec 01 2013 13:35:02 %S A206558 0,0,0,0,0,0,0,1,0,1,1,2,2,4,4,8,8,13,15,23,26,38,45,63,74,101,120, %T A206558 160,191,248,298,383,457,579,694,868,1038,1287,1536,1890,2251,2746, %U A206558 3267,3962,4698,5665,6706,8043,9496,11337,13354,15876,18657,22089 %N A206558 Number of 8's in the last section of the set of partitions of n. %C A206558 Zero together with the first differences of A024792. Also number of occurrences of 8 in all partitions of n that do not contain 1 as a part. For the definition of "last section of n" see A135010. It appears that the sums of eight successive terms give the partition numbers A000041. %F A206558 It appears that A000041(n) = Sum_{j=1..8} a(n+j), n >= 0. %o A206558 (Sage) A206558 = lambda n: sum(list(p).count(8) for p in Partitions(n) if 1 not in p) %Y A206558 Column 8 of A182703 and of A194812. %Y A206558 Cf. A000041, A135010, A138121, A182712-A182714, A206555- A206557, A206559, A206560. %K A206558 nonn %O A206558 1,12 %A A206558 _Omar E. Pol_, Feb 09 2012