|
Search: id:A092092
|
|
|
| A092092 |
|
Back and Forth Summant S(n, _3): a(n) = sum_{i = 0..floor(2n/3)} n-3i. |
|
+0
2
|
|
| 1, 1, 0, 3, 2, 0, 5, 3, 0, 7, 4, 0, 9, 5, 0, 11, 6, 0, 13, 7, 0, 15, 8, 0, 17, 9, 0, 19, 10, 0, 21, 11, 0, 23, 12, 0, 25, 13, 0, 27, 14, 0, 29, 15, 0, 31, 16, 0, 33, 17, 0, 35, 18, 0, 37, 19, 0, 39, 20, 0, 41, 21, 0, 43, 22, 0, 45, 23, 0, 47, 24, 0, 49, 25, 0, 51, 26, 0, 53, 27, 0, 55, 28
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
J. Dezert, editor, Smarandacheials, Mathematics Magazine, Aurora, Canada, No. 4/2004.
F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972.
F. Smarandache, Back and Forth Summants, Arizona State Univ., Special Collections, 1972.
|
|
LINKS
|
J. Dezert, Smaran dacheials
J. Dezert, S marandacheials, "Mathematics Magazine", Canada
F. Smarandache, Summants
|
|
FORMULA
|
a(3n) = 0; a(3n+1) = 2n+1; a(3n+2) = n+1.
|
|
PROGRAM
|
(PARI) S(n, k=3) = local(s, x); s = n; x = n - k; while (x >= -n, s = s + x; x = x - k); s;
|
|
CROSSREFS
|
Cf. A092094, A092397.
Other values of k: A000004 (k = 1, 2), A027656 (k = 4), A092093 (k = 5).
Adjacent sequences: A092089 A092090 A092091 this_sequence A092093 A092094 A092095
Sequence in context: A011231 A138377 A021316 this_sequence A086800 A079408 A114376
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jahan Tuten (jahant(AT)indiainfo.com), Mar 29 2004
|
|
EXTENSIONS
|
Edited and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Dec 19 2005
|
|
|
Search completed in 0.002 seconds
|
