Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049824
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049824 a(n)=number of 3's in n-th row of array T given by A049816. +0
1
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, 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, 11, 16, 11, 16 (list; graph; listen)
OFFSET

1,11

EXAMPLE

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.

CROSSREFS

Adjacent sequences: A049821 A049822 A049823 this_sequence A049825 A049826 A049827

Sequence in context: A029306 A116491 A131325 this_sequence A133087 A048996 A111786

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research