Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133699
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133699 A051731 * A133698. +0
2
1, 1, 1, 1, 0, 2, 1, 1, 0, 1, 1, 0, 0, 0, 2, 1, 1, 2, 0, 0, 2, 1, 0, 0, 0, 0, 0, 2, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 0, 3, 1, 1, 0, 0, 2, 0, 0, 0, 0, 2 (list; table; graph; listen)
OFFSET

1,6

COMMENT

Right border = A001227, the number of odd divisors of n. Row sums = A133700: (1, 2, 3, 3, 3, 6, 3, 4, 6, 6,...)

FORMULA

Inverse Mobius transform of A133698, as infinite lower triangular matrices.

EXAMPLE

First few rows of the triangle are:

1;

1, 1;

1, 0, 2;

1, 1, 0, 1;

1, 0, 0, 0, 2;

1, 1, 2, 0, 0, 2;

1, 0, 0, 0, 0, 0, 2;

1, 1, 0, 1, 0, 0, 0, 1;

...

CROSSREFS

Cf. A051731, A133698, A133700.

Sequence in context: A035155 A090584 A128409 this_sequence A101808 A145865 A076452

Adjacent sequences: A133696 A133697 A133698 this_sequence A133700 A133701 A133702

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 21 2007

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 December 4 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research