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!)
A332543 a(n) = n + A332542(n) + 1. 4

%I #17 Apr 30 2020 03:59:24

%S 6,12,20,10,14,56,24,15,22,33,39,26,21,48,272,34,38,76,28,33,46,69,40,

%T 50,39,36,116,58,62,992,96,51,70,45,111,74,57,65,205,82,86,172,55,69,

%U 94,141,112,70,75,68,212,106,66,77,133,87,118,177,183,122

%N a(n) = n + A332542(n) + 1.

%C Note that A332542 is well-defined for all n. - _N. J. A. Sloane_, Feb 20 2020

%H Seiichi Manyama, <a href="/A332543/b332543.txt">Table of n, a(n) for n = 3..10000</a>

%H J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, <a href="http://arxiv.org/abs/2004.14000">Three Cousins of Recaman's Sequence</a>, arXiv:2004:14000, April 2020

%e See A332542.

%p See A332542.

%Y Cf. A332542, A332544, A082183.

%K nonn

%O 3,1

%A _Scott R. Shannon_, Feb 18 2020

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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)