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

%I A007604 M0567
%S A007604 1,2,3,4,6,9,12,16,22,31,40,52,68,90,121,152,192,244,312,402,523,644,
%T A007604 796,988,1232,1544,1946,2469,2992,3636,4432,5420,6652,8196,10142,12611,
%U A007604 15080,18072,21708,26140,31560,38212,46408,56550,69161,81772,96852
%N A007604 Sequence formed from rows of triangle A046936.
%C A007604 A003056(n) gives the number of odd terms in the first n terms of this 
               sequence. Modulo 2, this sequence becomes A023531. - T. D. Noe, Jul 
               24 2007
%D A007604 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A007604 T. D. Noe, <a href="b007604.txt">Table of n, a(n) for n=1..1000</a>
%F A007604 a(n)=a(n-1)+a(n-1- number of odd terms so far).
%t A007604 a[n_Integer] := a[n] = Block[{c, k}, c = 0; k = 1; While[k < n, If[ OddQ[ 
               a[k] ], c++ ]; k++ ]; Return[a[n - 1] + a[n - 1 - c] ] ]; a[1] = 
               1; a[2] = 2; Table[ a[n], {n, 0, 60} ]
%Y A007604 Cf. A006336
%Y A007604 Sequence in context: A069907 A001935 A083365 this_sequence A013950 A018550 
               A035952
%Y A007604 Adjacent sequences: A007601 A007602 A007603 this_sequence A007605 A007606 
               A007607
%K A007604 nonn,nice,easy
%O A007604 1,2
%A A007604 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

Search completed in 0.001 seconds