|
Search: id:A145826
|
|
|
| A145826 |
|
Arises from critical number of finite Abelian groups. |
|
+0 1
|
|
| 7, 8, 11, 14, 19, 21, 26, 29, 34, 41, 43, 50, 55, 57, 62, 68, 75, 77, 84, 89, 91, 98, 102, 109, 117, 122, 124, 128, 131, 135, 150, 155, 161, 163, 174, 176, 183, 189, 194, 200, 206, 209, 219, 221, 226, 228, 241, 254, 258, 260, 264, 271, 273, 283, 290, 296, 302
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Freeze, Gao, Geroldinger abstract: Let G be an additive, finite Abelian group. The critical number cr(G) of G is the smallest positive integer L such that for every subset S of {G setminus 0} with |S| => L the following holds: Every element of G can be written as a nonempty sum of distinct elements from S. The critical number was first studied by P. Erdos and H. Heilbronn in 1964 and due to the contributions of many authors the value of cr(G) is known for all finite Abelian groups G except for G == Z}/pq{Z where p, q are primes such that p+floor(2 sqrt{p-2})+1 < q < 2p. We determine that cr(G) = p+q-2 for such groups.
|
|
REFERENCES
|
P. Erdos and H. Heilbronn, On the addition of residue classes modulo p, Acta Arith. 9 (1964), 149 - 159.
|
|
LINKS
|
Michael Freeze, Weidong Gao and Alfred Geroldinger, The critical number of finite Abelian groups, Oct 17, 2008.
|
|
FORMULA
|
a(n) = p(n) + floor(2*(sqrt(p(n)+2)) + 1, where p(n) = n-th prime = A000040(n).
a(n)>= A000006(n)+A008864(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 05 2009]
|
|
EXAMPLE
|
a(10) = p(10) + floor(2*(sqrt(p(10)+2)) + 1 = 29 + floor(2*(sqrt(29+2)) + 1 = 29 + floor(2*5.56776436) + 1 = 29 + floor(11.1355287) + 1 = 29 + 11 + 1 = 41.
|
|
CROSSREFS
|
Cf. A000040.
Sequence in context: A071117 A054221 A090385 this_sequence A102963 A117619 A098731
Adjacent sequences: A145823 A145824 A145825 this_sequence A145827 A145828 A145829
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 20 2008
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 05 2009
|
|
|
Search completed in 0.002 seconds
|