login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030194 Let S = triangular numbers; a(0)=0; a(n) = smallest m such that m - a(i) is not in S for any i < n. 0

%I

%S 0,2,4,9,11,13,18,20,22,27,29,31,51,53,60,62,69,71,85,94,101,103,110,

%T 112,141,143,150,152,159,161,168,170,211,220,229,245,267,269,292,299,

%U 301,308,310,317,319,326,348,357,359

%N Let S = triangular numbers; a(0)=0; a(n) = smallest m such that m - a(i) is not in S for any i < n.

%D Related papers: A. Sárközy. On the difference sets of sequences of integers, Acta. Math. Acad. Sci. Hungar. 31(1978), no. 1-2, 125-149; no. 3-4, 355-386; Ann. Univ. Sci. Budapest. Eotvos Sect. Math. 21(1978), 45-53.

%D I. Z. Rusza. Difference sets without squares, Periodica Math. Hugarica 15(1984), 205-209.

%K nonn

%O 0,2

%A _Jan Kristian Haugland_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 11:46 EST 2019. Contains 329319 sequences. (Running on oeis4.)