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!)
A005662 Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)
(Formerly M3375)
3

%I M3375 #38 Feb 29 2024 10:49:33

%S 4,10,15,22,32,33,46,48,66,68,69,94,98,99,102,134,138,140,141,147,190,

%T 198,200,201,206,207,210,270,278,282,284,285,296,297,300,309,382,398,

%U 402,404,405,414,416,417,422,423,426,444,542,558,566,570,572,573,594

%N Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)

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

%H Seiichi Manyama, <a href="/A005662/b005662.txt">Table of n, a(n) for n = 1..10000</a>

%H R. K. Guy, <a href="/A005658/a005658.pdf">Letter to N. J. A. Sloane with attachment, 1982</a>

%e 208857, 313286 and 626574 are terms and 626574 = 2*313286 + 2 = 3*208857 + 3. - _Seiichi Manyama_, Feb 29 2024

%Y Cf. A005660.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

%E More terms from Larry Reeves (larryr(AT)acm.org), Oct 01 2001

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 August 13 06:03 EDT 2024. Contains 375113 sequences. (Running on oeis4.)