|
%I M0441 #50 Mar 28 2022 07:45:08
%S 1,1,2,3,3,4,5,6,6,7,7,8,9,10,10,11,12,12,13,14,15,16,16,17,17,18,19,
%T 19,20,20,21,22,23,24,24,25,26,26,27,28,29,29,30,30,30,31,32,33,34,35,
%U 36,36,37,37,38,39,39,40,41,42,43,43,44,45,45,45,46
%N a(1) = a(2) = 1; for n > 2, a(n) = a(a(n-2)) + a(n - a(n-2)).
%C By induction a(n) <= n, but an exact rate of growth is not known.
%D J. Arkin, D. C. Arney, L. S. Dewald, and W. E. Ebel, Jr., Families of recursive sequences, J. Rec. Math., 22 (No. 22, 1990), 85-94.
%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="/A005229/b005229.txt">Table of n, a(n) for n=1..1000</a>
%H Altug Alkan, <a href="https://doi.org//10.1155/2018/8517125">On a Generalization of Hofstadter's Q-Sequence: A Family of Chaotic Generational Structures</a>, Complexity (2018), Article ID 8517125.
%H Nick Hobson, <a href="/A005229/a005229.py.txt">Python program for this sequence</a>
%H C. L. Mallows, <a href="http://www.jstor.org/stable/2324028">Conway's challenge sequence</a>, Amer. Math. Monthly, 98 (1991), 5-20.
%H N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MallowsSequence.html">Mallows' Sequence</a>.
%p A005229:= proc(n) option remember;
%p if n<=2 then 1 else A005229(A005229(n-2)) +A005229(n-A005229(n-2));
%p fi; end;
%p seq(A005229(n), n=1..70)
%t a[1] = a[2] = 1; a[n_] := a[n] = a[a[n-2]] + a[n - a[n-2]]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Sep 06 2013 *)
%o (PARI) a(n)=an[n]; an=vector(100,n,1); for(n=3,100,an[n]=a(a(n-2))+a(n-a(n-2)))
%o (Haskell)
%o import Data.Function (on)
%o a005229 n = a005229_list !! (n-1)
%o a005229_list = 1 : 1 : zipWith ((+) `on` a005229)
%o a005229_list (zipWith (-) [3..] a005229_list)
%o -- _Reinhard Zumkeller_, Jan 17 2014
%o (Sage)
%o @CachedFunction
%o def a(n): # A005229
%o if (n<3): return 1
%o else: return a(a(n-2)) + a(n-a(n-2))
%o [a(n) for n in (1..100)] # _G. C. Greubel_, Mar 27 2022
%Y Cf. A004001, A051105, A087758, A116591, A147880, A169638.
%K nonn,nice,easy
%O 1,3
%A _N. J. A. Sloane_, _Simon Plouffe_
%E Typo in definition corrected by Nick Hobson, Feb 21 2007
|
