Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010006
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010006 Coordination sequence for C_3 lattice. +0
2
1, 18, 66, 146, 258, 402, 578, 786, 1026, 1298, 1602, 1938, 2306, 2706, 3138, 3602, 4098, 4626, 5186, 5778, 6402, 7058, 7746, 8466, 9218, 10002, 10818, 11666, 12546, 13458, 14402, 15378, 16386, 17426 (list; graph; listen)
OFFSET

0,2

COMMENT

If Y_i (i=1,2,3) are 2-blocks of a (2n+1)-set X then a(n-1) is the number of 5-subsets of X intersecting each Y_i (i=1,2,3). - Milan R. Janjic (agnus(AT)blic.net), Oct 28 2007

REFERENCES

R. Bacher, P. de la Harpe and B. Venkov, Series de croissance et series d'Ehrhart associees aux reseaux de racines, C. R. Acad. Sci. Paris, 325 (Series 1) (1997), 1137-1142.

J. Serra-Sagrista, Enumeration of lattice points in l_1 norm, Information Processing Letters, 76, no. 1-2 (2000), 39-44.

LINKS

Milan Janjic, Two Enumerative Functions

FORMULA

a(0)=1, a(n)=16*n^2 + 2, n >= 1; G.f.: (1+15*x+15*x^2+x^3)/(1-x)^3.

G.f. for coordination sequence of C_n lattice: Sum(binomial(2*n, 2*i)*z^i, i=0..n)/(1-z)^n.

CROSSREFS

Sequence in context: A105521 A090073 A016728 this_sequence A044156 A044537 A063523

Adjacent sequences: A010003 A010004 A010005 this_sequence A010007 A010008 A010009

KEYWORD

nonn

AUTHOR

njas, mbaake(AT)sunelc3.tphys.physik.uni-tuebingen.de (Michael Baake)

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 July 4 01:34 EDT 2008. Contains 140787 sequences.


AT&T Labs Research