Search: id:A068909
Results 1-1 of 1 results found.

%I A068909
%S A068909 1,1,2,3,5,0,4,1,1,2,0,0,0,3,2,1,0,3,0,0,4,1,1,2,0,5,0,0,1,1,4,3,5,0,4,
%T A068909 1,1,0,3,0,0,0,2,2,2,3,5,0,0,2,1,4,0,0,0,0,3,2,2,3,5,0,4,2,2,2,3,5,0,4,
%U A068909 3,2,4,6,5,0,0,2,2,4,3,5,0,0,3,3,6,6,3,0,1,3,3,4,3,5,0,0,4,3,4,6,5,0,1
%N A068909 Number of partitions of n modulo 7.
%C A068909 Of the partitions of numbers from 1 to 100000: 27193 are 0, 12078 are 
               1, 12203 are 2, 12260 are 3, 12231 are 4, 12003 are 5 and 12032 are 
               6 modulo 7, largely because the number of partitions of 7m+5 is always 
               a multiple of 7.
%H A068909 Henry Bottomley, <a href="http://www.btinternet.com/~se16/js/partitions.htm">
               Partition calculators using java applets</a>
%H A068909 <a href="Sindx_Par.html#part">Index entries for sequences related to 
               partitions</a>
%F A068909 a(n) =A010876(A000041(n)) =A068906(7, n)
%F A068909 a(n) = Pm(n,1) with Pm(n,k) = if k<n then (Pm(n-k,k) + Pm(n,k+1)) mod 
               7 else 0^(n*(k-n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Jun 09 2009]
%Y A068909 Cf. A040051, A068907, A068908, A020919.
%Y A068909 Sequence in context: A024595 A144804 A118308 this_sequence A039705 A082118 
               A079344
%Y A068909 Adjacent sequences: A068906 A068907 A068908 this_sequence A068910 A068911 
               A068912
%K A068909 nonn
%O A068909 0,3
%A A068909 Henry Bottomley (se16(AT)btinternet.com), Mar 05 2002

Search completed in 0.001 seconds