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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057606 Triangle read by rows: T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 3, 1<=k<=2^(n-2)). 1
2, 6, 2, 4, 6, 4, 2, 4, 8, 4, 8, 4, 2, 0, 2, 4, 10, 6, 12, 8, 8, 6, 6, 0, 2, 0, 0, 0, 0, 0, 2, 4, 12, 8, 16, 14, 16, 12, 12, 12, 6, 4, 8, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 14, 10, 20, 22, 24, 22, 22, 26, 18, 16, 12, 16, 12, 0, 4, 10, 0, 0, 0, 2, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

COMMENTS

Row lengths = powers of 2.

REFERENCES

N. J. A. Sloane, On single-deletion-correcting codes, in Codes and Designs (Columbus, OH, 2000), 273-291, Ohio State Univ. Math. Res. Inst. Publ., 10, de Gruyter, Berlin, 2002.

LINKS

N. J. A. Sloane, On single-deletion-correcting codes

EXAMPLE

2,6; 2,4,6,4; 2,4,8,4,8,4,2,0; ...

CROSSREFS

Cf. A057607.

Sequence in context: A151944 A073094 A194953 * A021385 A085193 A060295

Adjacent sequences:  A057603 A057604 A057605 * A057607 A057608 A057609

KEYWORD

nonn,tabf,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 08 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.