# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a035940
Showing 1-1 of 1

%I A035940 #15 Jan 12 2019 20:16:08
%S A035940 0,1,1,2,2,4,4,6,7,10,12,17,19,26,31,40,47,61,71,90,106,131,154,190,
%T A035940 222,270,317,381,445,533,620,737,857,1011,1173,1379,1593,1863,2151,
%U A035940 2503,2881,3343,3837,4435,5083,5853,6693,7688,8769,10043,11437,13061
%N A035940 Number of partitions in parts not of the form 9k, 9k+1 or 9k-1. Also number of partitions with no part of size 1 and differences between parts at distance 3 are greater than 1.
%C A035940 Case k=4, i=1 of Gordon Theorem.
%D A035940 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
%F A035940 a(n) ~ exp(2*Pi*sqrt(n)/3) / (6 * (1+2*cos(2*Pi/9)) * n^(3/4)). - _Vaclav Kotesovec_, Nov 12 2015
%p A035940 # See A035937 for GordonsTheorem
%p A035940 A035940_list := n -> GordonsTheorem([0, 1, 1, 1, 1, 1, 1, 0, 0], n):
%p A035940 A035940_list(40) # _Peter Luschny_, Jan 22 2012
%t A035940 nmax = 60; Rest[CoefficientList[Series[Product[1 / ((1 - x^(9*k-2)) * (1 - x^(9*k-3)) * (1 - x^(9*k-4)) * (1 - x^(9*k-5)) * (1 - x^(9*k-6)) * (1 - x^(9*k-7)) ), {k, 1, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, Nov 12 2015 *)
%o A035940 (Sage) # See A035937 for GordonsTheorem
%o A035940 def A035940_list(len) :  return GordonsTheorem([0, 1, 1, 1, 1, 1, 1, 0, 0], len)
%o A035940 A035940_list(40) # _Peter Luschny_, Jan 22 2012
%K A035940 nonn,easy
%O A035940 1,4
%A A035940 _Olivier Gérard_

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE