|
Search: id:A005255
|
|
|
| A005255 |
|
Atkinson-Negro-Santoro sequence: all sums of terms are distinct.
(Formerly M1076)
|
|
+0
1
|
|
| 1, 2, 4, 7, 13, 24, 46, 88, 172, 337, 667, 1321, 2629, 5234, 10444, 20842, 41638, 83188, 166288, 332404, 664636, 1328935, 2657533, 5314399, 10628131, 21254941, 42508561, 85014493, 170026357, 340047480, 680089726, 1360169008, 2720327572
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
T. V. Narayana, Recent progress and unsolved problems in dominance theory, pp. 68-78 of Combinatorial mathematics (Canberra 1977), Lect. Notes Math. Vol. 686, 1978.
T. V. Narayana, Lattice Path Combinatorics with Statistical Applications. Univ. Toronto Press, 1979, pp. 100-101.
W. F. Lunnon, Integer sets with distinct subset-sums, Math. Comp., 50 (1988), 297-320.
M. D. Atkinson et al., Sums of lexicographically ordered sets, Discrete Math., 80 (1990), 115-122.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..300
|
|
FORMULA
|
a(n+1)=2a(n)-a(n-[ n/2+1 ]).
|
|
MATHEMATICA
|
a[ 0 ] := 0; a[ 1 ] := 1; a[ n_ ] := 2*a[ n - 1 ] - a[(n - 1) - Floor[ (n - 1)/2 + 1 ] ]; For[ n = 1, n <= 100, n++, Print[ a[ n ] ] ];
|
|
CROSSREFS
|
Adjacent sequences: A005252 A005253 A005254 this_sequence A005256 A005257 A005258
Sequence in context: A088353 A018184 A018185 this_sequence A086445 A127602 A113291
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Simon Plouffe (plouffe(AT)math.uqam.ca)
|
|
EXTENSIONS
|
More terms from Winston C. Yang (winston(AT)cs.wisc.edu), Aug 26 2000
|
|
|
Search completed in 0.002 seconds
|
