Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134803
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134803 Numbers n such that the sum of all numbers of the same parity <= n is equal to the sum of numbers of the opposite parity from n+1 to n+m, where m is odd and > 1. +0
2
3, 8, 119, 288, 4059, 9800 (list; graph; listen)
OFFSET

1,1

EXAMPLE

3 -> 1+3 = 4 = 4

8 -> 2+4+6+8 = 20 = 9+11

119 -> 1+3+5+...+119 = 3600 = 120+122+...+168

MAPLE

P:=proc(n) local a, k, i, s1, s2; for i from 1 by 1 to n do if 2*trunc(i/2)=i then s1:=sum('2*k', 'k'=1..(i/2)); else s1:=sum('2*k-1', 'k'=1..(i+1)/2); fi; a:=1; s2:=i+1; while s1>s2 do a:=a+2; s2:=s2+i+a; od; if s1=s2 then lprint(i, s1); fi; od; end: P(10000);

CROSSREFS

Cf. A001109, A084068, A089895.

Sequence in context: A066619 A028504 A123279 this_sequence A030063 A051047 A036504

Adjacent sequences: A134800 A134801 A134802 this_sequence A134804 A134805 A134806

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jan 28 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

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


AT&T Labs Research