A005594 States of a dynamic storage system.
1, 2, 4, 7, 14, 26, 59, 122, 284, 647, 1528, 3602, 8679, 20882, 50824, 124055, 304574, 750122, 1855099, 4600202, 11442086, 28527447, 71292604, 178526882, 447919419, 1125750146, 2833906684, 7144450567, 18036423974
Offset: 0
Keywords
References
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
- C. G. Bower, Transforms
- INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 107
- INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 111
- M. D. McIlroy, The number of states of a dynamic storage system, Computer J., 25 (No. 3, 1982), 388-392.
- M. D. McIlroy, The number of states of a dynamic storage system, Computer J., 25 (No. 3, 1982), 388-392. (Annotated scanned copy)
- Index entries for sequences related to necklaces
Crossrefs
Equals A032198(n)+1.
Programs
-
Mathematica
nmax = 30; f[x_] = Sum[n*x^n, {n, 1, nmax}]; gf = Sum[(EulerPhi[n]/n)*Log[1/(1 - f[x^n])] + O[x]^nmax, {n, 1, nmax}]; CoefficientList[gf, x] + 1 (* Jean-François Alcover, Jul 29 2018, after Joerg Arndt *)
Formula
Also "CIK" (necklace, indistinct, unlabeled) transform of 2, 1, 1, 1, ...
Extensions
Sequence extended by Christian G. Bower