Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127371
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127371 Triangle, row sums = n, left column = d(n). +0
1
1, 2, 0, 2, 1, 0, 3, 0, 1, 0, 2, 1, 1, 1, 0, 4, 1, 0, 0, 1, 0, 2, 1, 1, 1, 1, 1, 0, 4, 0, 2, 0, 1, 0, 1, 0, 3, 2, 0, 1, 1, 0, 1, 1, 0, 4, 1, 2, 1, 0, 0, 1, 0, 1, 0, 1, 0 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Row sums = n, left column = d(n), (A000005: 1, 2, 2, 3, 2, 4, 2,...)

FORMULA

A051731 * A054521, as infinite lower triangular matrices. Inverse Mobius transform of A054521.

EXAMPLE

First few rows of the triangle are:

1;

2, 0;

2, 1, 0;

3, 0, 1, 0;

2, 1, 1, 1, 0;

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

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

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

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

...

CROSSREFS

Cf. A051731, A000005, A054521.

Adjacent sequences: A127368 A127369 A127370 this_sequence A127372 A127373 A127374

Sequence in context: A067167 A096810 A133696 this_sequence A036849 A097364 A074905

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 12 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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research