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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232467 Triangle read by rows: T(n,k) = number of fully connected (n,k) corner designs (n >= 0, 1 <= k <= n+1). 5

%I

%S 1,2,1,6,3,2,32,21,18,9,354,257,219,159,75,8520,6203,5203,4166,2985,

%T 1355

%N Triangle read by rows: T(n,k) = number of fully connected (n,k) corner designs (n >= 0, 1 <= k <= n+1).

%H Craig S. Kaplan, <a href="http://archive.bridgesmathart.org/2013/bridges2013-317.pdf">Grid-based decorative corners</a>, in Proceedings of Bridges 2013: Mathematics, Music, Art, ..., 2013, pp. 317-324.

%H Craig S. Kaplan, <a href="/A232467/a232467.pdf">Illustrations of corner designs</a> (some slides from Bridges 2013 talk - see above link for full article)

%e Triangle begins:

%e 1

%e 2 1

%e 6 3 2

%e 32 21 18 9

%e 354 257 219 159 75

%e 8520 6203 5203 4166 2985 1355

%e ...

%Y Cf. A232468, A232469, A232470, A232471.

%K nonn,tabl,nice,more

%O 0,2

%A _N. J. A. Sloane_, Nov 24 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 22:00 EDT 2018. Contains 316378 sequences. (Running on oeis4.)