id:A123737 - OEIS Search Results

Search: id:A123737

Displaying 1-1 of 1 results found.

page 1

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

+0
5

-1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, -2, -1, -2, -3, -2, -1, -2, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0 (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[Sqrt[2]*Range[120]]]]`
	CROSSREFS	`Cf. A123724 (sum for 2^(1/3)), A123738 (sum for pi), A123739 (sum for e).` `Sequence in context: A080733 A080732 A088568 this_sequence A083037 A072927 A120086` `Adjacent sequences: A123734 A123735 A123736 this_sequence A123738 A123739 A123740`
	KEYWORD	`easy,sign`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Oct 11 2006`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research