login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049824 a(n)=number of 3's in n-th row of array T given by A049816. 0

%I

%S 0,0,0,0,0,0,0,1,0,0,2,1,1,2,1,2,4,2,4,3,0,4,8,5,3,5,6,5,7,3,6,9,7,8,

%T 9,6,8,12,9,8,9,7,12,11,5,12,18,12,10,9,11,12,17,16,12,14,10,18,22,12,

%U 11,16,11,16

%N a(n)=number of 3's in n-th row of array T given by A049816.

%e There are 2 numbers k from 1 to 11 for which the Euclidean algorithm on (11,k) has exactly 3 nonzero remainders; hence a(11)=2.

%K nonn

%O 1,11

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 03:10 EDT 2019. Contains 323507 sequences. (Running on oeis4.)