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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079302 Number of minimal non-Brauer chains for n. 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; refs; listen; history; text; internal format)
OFFSET

1,19

COMMENTS

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, Brauer Chain.

EXAMPLE

13 has a(13) = 1 minimal non-Brauer chain: (1,2,4,5,8,13).

CROSSREFS

Sequence in context: A080300 A116864 A255308 * A138806 A181105 A142971

Adjacent sequences:  A079299 A079300 A079301 * A079303 A079304 A079305

KEYWORD

nonn

AUTHOR

David W. Wilson, Feb 09 2003

STATUS

approved

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 November 20 04:05 EST 2017. Contains 294959 sequences.