Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095200
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095200 Greatest multiple of n of the form (n-1) + (n-2) + ... + (n-k), or 0 if no such number exists. +0
3
0, 0, 3, 0, 10, 12, 21, 0, 36, 30, 55, 60, 78, 70, 105, 0, 136, 108, 171, 180, 210, 176, 253, 240, 300, 234, 351, 168, 406, 420, 465, 0, 528, 408, 595, 252, 666, 532, 741, 480, 820, 840, 903, 880, 990, 782, 1081, 1008, 1176, 900, 1275, 1248, 1378, 1080, 1485, 1512 (list; graph; listen)
OFFSET

1,3

COMMENT

a(2n-1) = (n-1)*(2n-1) (the (2n-2)-th triangular number, with k = 2n-2). a(2^n) = 0.

EXAMPLE

a(6) = 5+4+3 = 12.

a(7) = 6+5+4+3+2+1=21.

MAPLE

A095200 := proc(n) local k, m; for k from n to 1 by -1 do m := n*k-k*(k+1)/2 ; if m > 0 and m mod n = 0 then RETURN(m) ; fi ; od ; RETURN(0) ; end: for n from 1 to 100 do printf("%d, ", A095200(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2007

CROSSREFS

Cf. A095201, A095202.

Sequence in context: A081658 A119957 A028852 this_sequence A090460 A071983 A094897

Adjacent sequences: A095197 A095198 A095199 this_sequence A095201 A095202 A095203

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 05 2004

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2007

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research