|
| |
|
|
A138796
|
|
Least possible k>0 with T(k)-T(j)=n, where T(i)>0 are the triangular numbers A000217.
|
|
3
| |
|
|
2, 3, 4, 3, 6, 4, 8, 4, 10, 6, 5, 7, 5, 6, 16, 9, 6, 10, 6, 8, 7, 12, 9, 7, 8, 7, 28, 15, 8, 16, 32, 8, 10, 8, 13, 19, 11, 9, 10, 21, 9, 22, 9, 10, 13, 24, 17, 10, 12, 11, 10, 27, 10, 13, 11, 12, 16, 30, 11, 31, 17, 11, 64, 11, 18, 34, 12, 14, 13, 36, 12, 37, 20, 12, 13, 12, 21, 40, 18
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| For T(k) see A138797, for j see A138798 and for T(j) see A138799.
The number of ways n can be written as difference of two triangular numbers is sequence A136107
|
|
|
LINKS
| Peter Pein, Mathematica notebook containing a faster algorithm.
|
|
|
EXAMPLE
| a(30)=8, because 30 = T(30)-T(29)=T(11)-T(8)=T(9)-T(5)=T(8)-T(3) and 8 is the least index of the minuends
|
|
|
MATHEMATICA
| T=#(#+1)/2&; Min[k/.{ToRules[Reduce[{T[k]-T[j]\[Equal]#, 0<j<k}, {j, k}, Integers]]}]&/@Range[2, 100]
|
|
|
CROSSREFS
| Cf. A000217, A109814, A118235, A136107, A138797, A138798, A138799.
Sequence in context: A126630 A167234 A088043 * A186970 A064380 A126214
Adjacent sequences: A138793 A138794 A138795 * A138797 A138798 A138799
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Peter Pein (petsie(AT)dordos.net), Mar 30, 2008
|
| |
|
|
