|
Search: id:A121924
|
|
|
| A121924 |
|
Number of splitting steps that one can take with a sequence of n 2's. See Definition 2.2 on page 12 of Wagner's thesis. |
|
+0
1
|
|
| 0, 1, 1, 3, 4, 4, 7, 9, 10, 10, 14, 17, 19, 20, 20, 25, 29, 32, 34, 35, 35, 41, 46, 50, 53, 55, 56, 56, 63, 69, 74, 78, 81, 83, 84, 84, 92, 99, 105, 110, 114, 117, 119, 120, 120, 129, 137, 144, 150, 155, 159, 162, 164, 165, 165, 175, 184, 192, 199, 205, 210, 214, 217
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
See Table 2.1 on page 12 of Wagner's PhD thesis for details. Many of the papers of Stephan Wagner are available at his home page in PDF format.
|
|
REFERENCES
|
S. Wagner, Graph-theoretical enumeration and digital expansions: an analytic approach, Dissertation, Fakult. f. Tech. Math. u. Tech. Physik, Tech. Univ. Graz, Austria, Feb., 2006.
S. Wagner and R. F. Tichy, "Extremal problems for topological indices in combinatorial chemistry", J. of Computational Biology, vol. 12 (2005), pp. 1004-1013.
|
|
LINKS
|
Robert F. Tichy and Stephan Wagner, Extremal Problems for Topological Indices in Combinatorial Chemistry.
Stephan Wagner, Home page of Stephan G. Wagner.
Stephan Wagner, Publications of Stephan G. Wagner.
|
|
FORMULA
|
a(n) = binomial(b(n),3) + (n-binomial(b(n),2))*(b(n)^2+3b(n)-2(n+1))/4, where b(n) = floor(sqrt(2n+1/4)+1/2) - Stephan Wagner (swagner(AT)sun.ac.za), Jul 18 2007
|
|
EXAMPLE
|
a(11) = 14 from the formula, since b(11) = 5.
|
|
CROSSREFS
|
Sequence in context: A084138 A127141 A014406 this_sequence A094948 A010612 A021033
Adjacent sequences: A121921 A121922 A121923 this_sequence A121925 A121926 A121927
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Sep 02 2006
|
|
EXTENSIONS
|
Edited by Stephan Wagner (swagner(AT)sun.ac.za), Jul 18 2007
|
|
|
Search completed in 0.002 seconds
|
