cp's OEIS Frontend

A292027 a(n) = a(n-7) + a(n-11), starting a(0)=a(1)=...= a(10) = 1.

%I A292027 #27 Oct 09 2018 20:27:07
%S A292027 1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,4,4,4,5,5,5,5,7,7,7,8,9,
%T A292027 9,9,12,12,12,13,16,16,16,20,21,21,22,28,28,28,33,37,37,38,48,49,49,
%U A292027 55,65,65,66,81,86,86,93,113,114,115,136,151,151,159,194,200,201,229,264,265,274
%N A292027 a(n) = a(n-7) + a(n-11), starting a(0)=a(1)=...= a(10) = 1.
%D A292027 Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw-Hill, 2012, 501-503.
%H A292027 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1,0,0,0,1).
%F A292027 G.f.: (x^6 + x^5 + x^4 + x^3 + x^2 + x + 1)/(1 - x^7 - x^11). - _R. J. Mathar_ and _N. J. A. Sloane_, Nov 10 2017
%t A292027 LinearRecurrence[{0,0,0,0,0,0,1,0,0,0,1},{1,1,1,1,1,1,1,1,1,1,1},80] (* _Harvey P. Dale_, Oct 09 2018 *)
%o A292027 (Java)
%o A292027 import java.util.Arrays;
%o A292027 public class IntegerSequences
%o A292027 {
%o A292027     public static void main(String[] args)
%o A292027     {
%o A292027         int j = 7;
%o A292027         int k = 11;
%o A292027         // Set N to the number of terms you would like to generate.
%o A292027         int N = 200;
%o A292027         long[] G = new long[N];
%o A292027         for(int i=0; i<k; i++)
%o A292027         {
%o A292027             G[i] = 1;
%o A292027         }
%o A292027         for(int i=k; i<N; i++)
%o A292027         {
%o A292027             G[i] = G[i-j]+G[i-k];
%o A292027         }
%o A292027         System.out.println(Arrays.toString(G));
%o A292027     }
%o A292027 }
%Y A292027 Cf. A000930, A003269, A003520, A005708, A005709.
%K A292027 nonn,easy
%O A292027 0,12
%A A292027 _Jason Bruce_, Sep 07 2017