|
Search: id:A079301
|
|
|
| A079301 |
|
Number of minimal Brauer chains for n. |
|
+0
7
|
|
| 1, 1, 1, 1, 2, 2, 5, 1, 3, 4, 15, 3, 9, 14, 4, 1, 2, 7, 31, 6, 26, 40, 4, 4, 13, 22, 5, 23, 114, 12, 64, 1, 2, 4, 43, 12, 33, 87, 18, 8, 20, 78, 4, 69, 14, 8, 183, 5, 11, 34, 4, 35, 171, 16, 139, 32, 148
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
In a general addition chain, each element > 1 is a sum of two previous elements. In a Brauer chain, each element > 1 is a sum of the immediately previous element and another previous element.
|
|
LINKS
|
D. W. Wilson, Table of n, a(n) for n = 1..1024
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
7 has a(7) = 5 minimal Brauer chains: (1,2,3,4,7), (1,2,3,5,7), (1,2,3,6,7), (1,2,4,5,7), (1,2,4,6,7).
|
|
CROSSREFS
|
Adjacent sequences: A079298 A079299 A079300 this_sequence A079302 A079303 A079304
Sequence in context: A084046 A016586 A073690 this_sequence A079300 A128932 A071950
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W Wilson (davidwwilson(AT)comcast.net), Feb 09 2003
|
|
|
Search completed in 0.002 seconds
|
