|
%I #38 Dec 03 2021 04:52:20
%S 1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,3,4,4,4,4,4,4,4,4,
%T 4,4,4,5,7,8,8,8,8,8,8,8,8,8,8,9,12,15,16,16,16,16,16,16,16,16,16,17,
%U 21,27,31,32,32,32,32,32,32,32,32,33,38,48,58,63,64,64,64,64,64,64,64,65
%N k=12 case of family of sequences beyond Fibonacci and Padovan: a(n) = a(n-12) + a(n-13).
%C k=12 case of the family of sequences whose k=1 case is the Fibonacci sequence A000045, k=2 case is the Padovan sequence A000931 (offset so as to begin 1,1,1), k=3 case is A079398 (offset so as to begin 1,1,1,1), k=4 case is A103372, k=5 case is A103373, k=6 case is A103374, k=7 case is A103375, k=8 case is A103376, k=9 case is A103377, k=10 case is A103378 and k=11 case is A103379.
%C The general case for integer k>1 is defined: a(1) = a(2) = ... = a(k+1)= 1 and for n>(k+1) a(n) = a(n-k) + a(n-(k+1)).
%C For this k=11 case, the ratio of successive terms a(n)/a(n-1) approaches the unique positive root of the characteristic polynomial: x^13 - x - 1 = 0. This is the real constant 1.0570505752... . Note that x = (1 + (1 + (1 + (1 + (1 + ...)^(1/13))^(1/13)))^(1/13))))^(1/13)))))^(1/13))))).
%C The sequence of prime values in this k=12 case is A103390.
%C The sequence of semiprime values in this k=12 case is A103400.
%D Zanten, A. J. van, The golden ratio in the arts of painting, building and mathematics, Nieuw Archief voor Wiskunde, 4 (17) (1999) 229-245.
%H T. D. Noe, <a href="/A103380/b103380.txt">Table of n, a(n) for n = 1..1000</a>
%H J.-P. Allouche and T. Johnson, <a href="http://www.math.jussieu.fr/~allouche/johnson2.pdf">Narayana's Cows and Delayed Morphisms</a>
%H Richard Padovan, <a href="http://www.nexusjournal.com/conferences/N2002-Padovan.html">Dom Hans van der Laan and the Plastic Number</a>.
%H E. S. Selmer, <a href="http://www.mscand.dk/article/view/10478/8499">On the irreducibility of certain trinomials</a>, Math. Scand., 4 (1956) 287-302.
%H J. Shallit, <a href="http://dx.doi.org/10.1016/0304-3975(88)90103-X">A generalization of automatic sequences</a>, Theoretical Computer Science, 61 (1988), 1-16.
%H <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,1,1).
%F For n>13: a(n) = a(n-12) + a(n-13). a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = a(7) = a(8) = a(9) = a(10) = a(11) = a(12) a(13) = 1.
%F G.f.: x*(1-x^12) / ((1-x)*(1-x^12-x^13)). - _Colin Barker_, Mar 27 2013
%p A103380 := proc(n) option remember ; if n <= 13 then 1; else procname(n-12)+procname(n-13) ; fi; end: for n from 1 to 120 do printf("%d,",A103380(n)) ; od: # _R. J. Mathar_, Aug 30 2008
%t LinearRecurrence[{0,0,0,0,0,0,0,0,0,0,0,1,1},{1,1,1,1,1,1,1,1,1,1,1,1,1},90] (* _Harvey P. Dale_, Jul 16 2012 *)
%Y Cf. A000931, A079398, A103372-A103379, A103390, A103400.
%K easy,nonn
%O 1,14
%A _Jonathan Vos Post_, Feb 16 2005
%E Terms from a(11) on corrected by _R. J. Mathar_, Aug 30 2008
|
