id:A123738 - OEIS Search Results

Search: id:A123738

Displaying 1-1 of 1 results found.

page 1

Partial sums of (-1)^floor(n*pi).

+0
4

-1, 0, -1, 0, -1, 0, -1, -2, -1, -2, -1, -2, -1, -2, -3, -2, -3, -2, -3, -2, -3, -4, -3, -4, -3, -4, -3, -4, -5, -4, -5, -4, -5, -4, -5, -6, -5, -6, -5, -6, -5, -6, -7, -6, -7, -6, -7, -6, -7, -8, -7, -8, -7, -8, -7, -8, -9, -8, -9, -8, -9, -8, -9, -10, -9, -10, -9, -10, -9, -10, -11, -10, -11, -10, -11, -10, -11, -12, -11, -12 (list; graph; listen)

	OFFSET	`1,8`
	REFERENCES	`Kevin O'Bryant, Bruce Reznick, and Monika Serbinowska, Almost alternating sums, Amer. Math. Monthly, Vol. 113 (October 2006), 673-688.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	MATHEMATICA	`Rest[FoldList[Plus, 0, (-1)^Floor[Pi*Range[120]]]]`
	CROSSREFS	`Cf. A123724 (sum for 2^(1/3)), A123737 (sum for sqrt(2)), A123739 (sum for e).` `Adjacent sequences: A123735 A123736 A123737 this_sequence A123739 A123740 A123741` `Sequence in context: A103682 A023134 A112632 this_sequence A030738 A114228 A060938`
	KEYWORD	`easy,sign`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Oct 11 2006`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research