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

%I A000202 M2323 N0918
%S A000202 1,3,4,6,8,9,11,12,14,16,17,19,21,22,24,25,27,29,30,32,34,35,37,38,40,
%T A000202 42,43,45,47,48,50,51,53,55,56,58,60,61,63,64,66,68,69,71,73,74,76,77,
%U A000202 79,81,82,84,86,87,89,90,92,94,95,97,99,100,102,103,105,107,108,110
%N A000202 a(8i+j) = 13i + a(j), where 1<=j<=8.
%D A000202 Problem H-12, Fib. Quart., 1 (No. 4, 1963), 50.
%D A000202 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000202 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%p A000202 a[0] := 0:a[1] := 1:a[2] := 3:a[3] := 4:a[4] := 6:a[5] := 8:a[6] := 9:a[7] 
               := 11:a[8] := 12: for m from 9 to 200 do if irem(m,8)=0 then myrem 
               := 8; myquo := iquo(m,8)-1; else myrem := irem(m,8); myquo := iquo(m,
               8) fi; a[m] := 13*myquo +a[myrem] od: for k from 1 to 200 do printf(`%a,
               `,a[k]) od:
%Y A000202 Different from A000201, A066096, A090908.
%Y A000202 Sequence in context: A090908 A066096 A000201 this_sequence A026339 A109259 
               A059535
%Y A000202 Adjacent sequences: A000199 A000200 A000201 this_sequence A000203 A000204 
               A000205
%K A000202 nonn
%O A000202 1,2
%A A000202 N. J. A. Sloane (njas(AT)research.att.com).
%E A000202 More terms and Maple program from James A. Sellers (sellersj(AT)math.psu.edu), 
               May 29 2000

Search completed in 0.001 seconds