[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A140735 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A140735 Triangle read by rows, X^n * [1,0,0,0,...]; where X = a tridiagonal matrix with (1,2,3,...) in the main diagonal and (1,1,1,...) in the sub and subsubdiagonals.
(history; published version)
#41 by Alois P. Heinz at Tue Apr 24 17:18:46 EDT 2018
STATUS

editing

approved

#40 by Alois P. Heinz at Tue Apr 24 17:18:08 EDT 2018
COMMENTS

T[(m,k] ) is the number of achiral color patterns in a row or loop of length 2m-1 using exactly k different colors. Two color patterns are equivalent if we permute the colors. - Robert A. Russell, Mar 24 2018

EXAMPLE

T[(3,3]=)=5 is the number of achiral color patterns of length five using exactly three colors. These are AABCC, ABACA, ABBBC, ABCAB, and ABCBA for both rows and loops. - Robert A. Russell, Mar 24 2018

STATUS

proposed

editing

#39 by Robert A. Russell at Tue Apr 24 14:09:43 EDT 2018
STATUS

editing

proposed

#38 by Robert A. Russell at Tue Apr 24 14:09:30 EDT 2018
FORMULA

T(m,k) = [m>1]*(k*Aodd[T(m-1,k]+Aodd[)+T(m-1,k-1]+Aodd[)+T(m-1,k-2]) + [)) + [m==1]*[k==1] - Robert A. Russell, Apr 24 2018

STATUS

proposed

editing

Discussion
Tue Apr 24 14:09
Robert A. Russell: Bad formula fixed.
#37 by Robert A. Russell at Tue Apr 24 14:04:28 EDT 2018
STATUS

editing

proposed

#36 by Robert A. Russell at Tue Apr 24 14:04:14 EDT 2018
FORMULA

T(m,k) = [m>01]*(k*Aodd[m-1,k]+Aodd[m-1,k-1]+Aodd[m-1,k-2]) + [m==01]*[k==01] - Robert A. Russell, Apr 24 2018

#35 by Robert A. Russell at Tue Apr 24 13:40:16 EDT 2018
FORMULA

T(m,k) = [m>0]*(k*Aodd[m-1,k]+Aodd[m-1,k-1]+Aodd[m-1,k-2]) + [m==0]*[k==0] - Robert A. Russell, Apr 24 2018

MATHEMATICA

Aodd[m_, k_] := Aodd[m, k] = If[m > 1, k Aodd[m-1, k] + Aodd[m-1, k-1]

+ Aodd[m-1, k-2], Boole[m==1 && k==1]]

Table[Aodd[m, k], {m, 1, 10}, {k, 1, 2m-1}] // Flatten (* Robert A. Russell, Apr 24 2018 *)

STATUS

approved

editing

#34 by N. J. A. Sloane at Tue Apr 17 00:09:01 EDT 2018
STATUS

proposed

approved

#33 by Robert A. Russell at Sat Apr 14 08:42:38 EDT 2018
STATUS

editing

proposed

#32 by Robert A. Russell at Sat Apr 14 08:40:47 EDT 2018
MATHEMATICA

(* Ach[n, , k] is the number of achiral color patterns for a row or loop of n colors containing k different colors *)

colors containing k different colors *)

Ach[n_, k_] := Ach[n, k] = SwitchWhich[k, 0==k, IfBoole[0==n, 1, 0], 1==k, IfBoole[n>0, 1, 0],

(* else *) _, If[OddQ[n],

OddQ[n], Sum[Binomial[(n-1)/2, i] Ach[n-1-2i, k-1], {i, 0, (n-1)/2}],

True, Sum[Binomial[n/2-1, i] (Ach[n-2-2i, k-1]

+ + 2^i Ach[n-2-2i, k-2]), {i, 0, n/2-1}]]]}]]

{i, 1, 2 n - 1}, {j, 1, 2 n - 1}], n-1][[1]], {n, 1, 710}]

CROSSREFS

Number of achiral color patterns of length even n in A293181.

STATUS

proposed

editing

Discussion
Sat Apr 14 08:42
Robert A. Russell: Simplified Mathematica program, added cross reference.

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 13:17 EDT 2024. Contains 375517 sequences. (Running on oeis4.)