|
Search: id:A079302
|
|
|
| A079302 |
|
Number of minimal non-Brauer chains for n. |
|
+0
4
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 3, 0, 0, 0, 1, 2, 0, 0, 18, 0, 13, 0, 0, 0, 0, 0, 6, 5, 2, 0, 3, 6, 0, 0, 0, 0, 37, 0, 1, 2, 0, 3, 34, 0, 17, 0, 25
(list; graph; listen)
|
|
|
OFFSET
|
1,19
|
|
|
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
|
13 has a(13) = 1 minimal non-Brauer chain: (1,2,4,5,8,13).
|
|
CROSSREFS
|
Adjacent sequences: A079299 A079300 A079301 this_sequence A079303 A079304 A079305
Sequence in context: A013372 A080300 A116864 this_sequence A138806 A104117 A114511
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W Wilson (davidwwilson(AT)comcast.net), Feb 09 2003
|
|
|
Search completed in 0.002 seconds
|
