Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110352
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110352 A110351(n)/T(n) where T(n) is the n-th triangular number. +0
3
2, 1, 5, 11, 2, 4, 41, 55, 13, 17, 7, 9, 32, 1, 26, 239, 59, 67, 14, 2, 12, 104, 60, 66, 137, 149, 46, 50, 23, 25, 929, 116, 20, 5, 39, 65, 314, 40, 6, 230, 34, 36, 117, 4, 82, 494, 219, 229, 563, 54, 27, 146, 662, 97, 9, 49, 91, 797, 220, 228, 884, 11, 740, 614, 18, 122, 251 (list; graph; listen)
OFFSET

1,1

MAPLE

A110351 := proc(n) local k ; for k from 1 to n*(n+1) do if (k*(2*n+k+1)) mod (n*(n+1)) =0 then RETURN(k*(n+(k+1)/2)) ; fi ; od ; RETURN(0) ; end: A110352 := proc(n) 2*A110351(n)/(n*(n+1)) ; end: for n from 1 to 100 do printf("%d, ", A110352(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 02 2007

MATHEMATICA

Do[t = n*(n + 1)/2; k = 1; While[Mod[k*n + k*(k + 1)/2, t] > 0, k++ ]; Print[(k*n + k*(k + 1)/2)/((n*(n + 1))/2)], {n, 1, 60}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 17 2006

CROSSREFS

Cf. A110351, A110353.

Sequence in context: A019098 A035309 A049948 this_sequence A107310 A049950 A095216

Adjacent sequences: A110349 A110350 A110351 this_sequence A110353 A110354 A110355

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 21 2005

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 17 2006

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 02 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research