Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072524
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072524 Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1. +0
2
0, 0, 0, 5, 8, 10, 33, 35, 37, 86, 87, 122, 112, 207, 215, 255, 354, 389, 448, 493, 633, 710, 681, 1016, 1042, 1214, 1420, 1518, 1645, 1654, 2050, 2180, 2276, 2828, 2654, 3124, 3131, 3751, 3770, 4267, 4465, 4971, 5170, 5759, 6282, 6315, 6807, 7587, 7419 (list; graph; listen)
OFFSET

1,4

EXAMPLE

The eighth triangular number is 36; division by 3, 6, 10, 15,21, 28 gives the remainders 0, 0, 6, 6, 15, 8, so a(8) = 0 + 0 + 6+ 6 + 15 + 8 = 35.

PROGRAM

(PARI) for(n=1, 50, s=0; for(j=2, n-1, s=s+binomial(n+1, 2)%binomial(j+1, 2)); print1(s, ", "))

CROSSREFS

Sequence in context: A164682 A157482 A057154 this_sequence A047700 A104275 A053726

Adjacent sequences: A072521 A072522 A072523 this_sequence A072525 A072526 A072527

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 31 2002

EXTENSIONS

Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 02 2002

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research