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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A290866 a(n) = number of segments (edges) in the configuration A290447(n). 6
 0, 1, 3, 8, 20, 45, 91, 168, 285, 450, 670, 981, 1375, 1902, 2568, 3371, 4326, 5522, 6927, 8639, 10624, 12882, 15489, 18559, 22006, 25904, 30321, 35254, 40728, 46959, 53721, 61354, 69734, 78917, 89029, 100018, 111758, 124759, 138943 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Only edges above the line are counted. Total edges = a(n) + n - 1. LINKS David Applegate, Table of n, a(n) for n = 1..100 FORMULA a(n) = A290447(n) + A290865(n). CROSSREFS Cf. A290447, A290865, A290867. Sequence in context: A192982 A096585 A057765 * A014628 A134393 A034504 Adjacent sequences: A290863 A290864 A290865 * A290867 A290868 A290869 KEYWORD nonn AUTHOR David Applegate, Aug 12 2017 STATUS approved

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.

Last modified September 10 08:45 EDT 2024. Contains 375786 sequences. (Running on oeis4.)