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!)
A151662 The first of three Hofstadter parents-child sequences of Thomas Stoll. 3

%I #8 Mar 02 2018 12:15:33

%S 1,0,2,1,3,3,4,4,5,7,7,8,7,10,8,10,10,11,10,13,11,13,13,14,16,16,17,

%T 16,19,17,19,19,20,21,21,22,22,23,24,24,25,24,27,25,27,27,28,30,30,31,

%U 30,33,31,33,33,34,36,36,37,36,39,37,39,39,40,39,42,40,42,42,43,45,45,46,45,48

%N The first of three Hofstadter parents-child sequences of Thomas Stoll.

%C Define three sequence a, b, c by: a[0]:=1; b[0]:=0; c[0]:=0; for n >= 1, b[n]:=n-c[b[n-1]]; a[n]:=n-b[a[n-1]]; c[n]:=n-a[c[n-1]].

%H Hugo Pfoertner, <a href="/A151662/b151662.txt">Table of n, a(n) for n = 0..10000</a>

%H Th. Stoll, <a href="http://www.fq.math.ca/Papers1/46_47-1/Stoll_11-08.pdf">On Hofstadter's married functions</a>, Fib. Q., 46/47 (2008/2009), 62-67.

%p M:=130;

%p a[0]:=1; b[0]:=0; c[0]:=0;

%p for n from 1 to M do

%p b[n]:=n-c[b[n-1]];

%p a[n]:=n-b[a[n-1]];

%p c[n]:=n-a[c[n-1]];

%p od:

%p A:=[seq(a[n],n=0..M)];

%p B:=[seq(b[n],n=0..M)];

%p C:=[seq(c[n],n=0..M)];

%Y See also A151663, A151664. Cf. A005206, A005378, A005379.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, May 30 2009

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 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)