login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003670 a(n) is smallest number which is uniquely a(j)+a(k).
(Formerly M3303)
1

%I M3303 #34 Mar 13 2023 04:45:22

%S 4,7,11,15,18,19,23,25,27,31,32,33,35,41,47,49,55,57,61,63,75,87,89,

%T 91,105,119,121,125,129,133,139,147,153,161,185,189,203,206,213,225,

%U 233,235,241,243,251,257,259,265,273,281,285,293,295,303,305,307,309,317

%N a(n) is smallest number which is uniquely a(j)+a(k).

%C Sequence is periodic mod 11301098.

%C An Ulam-type sequence - see A002858 for many further references, comments, etc. - _T. D. Noe_, Jan 21 2008

%D Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.

%D R. K. Guy, "s-Additive sequences", preprint, 1994.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A003670/b003670.txt">Table of n, a(n) for n = 1..10000</a>

%H Steven R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/stlrsky/stlrsky.html">Stolarsky-Harborth Constant</a> [Broken link]

%H Steven R. Finch, <a href="http://web.archive.org/web/20010207195349/http://www.mathsoft.com/asolve/constant/stlrsky/stlrsky.html">Stolarsky-Harborth Constant</a> [From the Wayback machine]

%H Steven R. Finch, <a href="https://www.emis.de/journals/EM/expmath/volumes/1/1.html">Patterns in 1-additive sequences</a>, Experimental Mathematics 1 (1992), 57-63.

%H R. K. Guy, <a href="/A007300/a007300.pdf">s-Additive sequences</a>, Preprint, 1994. (Annotated scanned copy)

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/UlamSequence.html">Ulam Sequence</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Ulam_number">Ulam number</a>

%H <a href="/index/U#Ulam_num">Index entries for Ulam numbers</a>

%t Nest[Append[#, SelectFirst[Union@ Select[Tally@ Map[Total, Select[Permutations[#, {2}], #1 < #2 & @@ # &]], Last@ # == 1 &][[All, 1]], Function[k, FreeQ[#, k]]]] &, {4, 7}, 56] (* _Michael De Vlieger_, Nov 16 2017 *)

%o (Haskell)

%o a003670 n = a003670_list !! (n-1)

%o a003670_list = 4 : 7 : ulam 2 7 a003670_list

%o -- Function ulam as defined in A002858.

%o -- _Reinhard Zumkeller_, Nov 03 2011

%K nonn

%O 1,1

%A _N. J. A. Sloane_, _Mira Bernstein_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)