Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049823
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049823 a(n)=number of 2's in n-th row of array T given by A049816. +0
1
0, 0, 0, 0, 1, 0, 2, 1, 2, 2, 4, 1, 4, 4, 4, 4, 7, 2, 6, 5, 6, 8, 8, 5, 7, 7, 8, 7, 10, 7, 10, 9, 9, 11, 12, 6, 11, 12, 10, 10, 12, 11, 10, 15, 12, 14, 14, 10, 14, 11, 16, 14, 12, 12, 17, 16, 16, 16, 14, 14, 10, 18, 15, 16, 20, 17, 16, 18, 19, 19 (list; graph; listen)
OFFSET

1,7

EXAMPLE

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

CROSSREFS

Sequence in context: A131097 A062790 A046640 this_sequence A003165 A122838 A050378

Adjacent sequences: A049820 A049821 A049822 this_sequence A049824 A049825 A049826

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research