login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105339 a(n) = n*(n+1)/2 mod 1024. 0

%I

%S 0,1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,

%T 231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,

%U 741,780,820,861,903,946,990,11,57,104,152,201,251,302,354,407,461,516,572,629

%N a(n) = n*(n+1)/2 mod 1024.

%t Mod[Accumulate[Range[0,100]],1024] (* _Harvey P. Dale_, Jun 30 2017 *)

%Y See A105198 for further information.

%K nonn

%O 0,3

%A _Oscar Takeshita_, May 01 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 04:16 EST 2020. Contains 331168 sequences. (Running on oeis4.)