Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082183
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082183 Smallest k>0 such that T(n)+T(k)=T(m), for some m, T(i) being the triangular numbers, n>1. +0
3
2, 5, 9, 3, 5, 27, 10, 4, 8, 14, 17, 9, 5, 21, 135, 12, 14, 35, 6, 9, 17, 30, 12, 18, 10, 7, 54, 21, 23, 495, 42, 14, 26, 8, 49, 27, 15, 20, 98, 30, 32, 80, 9, 19, 35, 62, 45, 17, 20, 14, 99, 39, 10, 18, 54, 24, 44, 78, 81, 45, 25, 85, 153, 11, 50, 125, 20, 29, 53, 94, 97 (list; graph; listen)
OFFSET

2,1

PROGRAM

(PARI) for(n=2, 100, t=n*(n+1)/2:for(k=1, 10^9, u=t+k*(k+1)/2:v=floor(sqrt(2*u)): if(v*(v+1)/2==u, print1(k", "):break)))

CROSSREFS

Cf. A072522, values of m are in A082184.

Adjacent sequences: A082180 A082181 A082182 this_sequence A082184 A082185 A082186

Sequence in context: A021390 A019802 A011432 this_sequence A111474 A111761 A021798

KEYWORD

nonn

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Apr 06 2003

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research