cp's OEIS Frontend

A381677 a(n) = floor(a(n-1)*3/2) with a(1) = 5.

%I A381677 #22 Mar 10 2025 04:49:35
%S A381677 5,7,10,15,22,33,49,73,109,163,244,366,549,823,1234,1851,2776,4164,
%T A381677 6246,9369,14053,21079,31618,47427,71140,106710,160065,240097,360145,
%U A381677 540217,810325,1215487,1823230,2734845,4102267,6153400,9230100,13845150,20767725,31151587,46727380,70091070,105136605,157704907
%N A381677 a(n) = floor(a(n-1)*3/2) with a(1) = 5.
%C A381677 The final number of animals if at each step two animals are bred and produce one offspring, starting with 5 animals (as in the game Minecraft, and waiting for all animals to be fully grown before the next round of breeding).
%e A381677 a(3) = floor(a(2)/2)+a(2) = floor(7/2)+7 = 3+7 = 10.
%t A381677 a[1]=5;a[n_]:=Floor[(a[n-1]*3/2)];Array[a,44] (* _James C. McMahon_, Mar 08 2025 *)
%o A381677 (Java) class Main {
%o A381677     public static void main(String[] args) {
%o A381677         long a=5; // if you need more than 103 terms, you will need to use BigInteger
%o A381677         System.out.print(a);
%o A381677         for(int n = 0; n<104;n++){
%o A381677             a += a/2;
%o A381677             System.out.print(","+a);
%o A381677         }
%o A381677     }
%o A381677 }
%o A381677 (PARI) lista(n)= my(t=10/3); vector(n, i, t=t*3\2) \\ _Ruud H.G. van Tol_, Mar 09 2025
%Y A381677 Cf. A032766, A061418.
%Y A381677 Cf. A112088 (first differences).
%K A381677 nonn,easy
%O A381677 1,1
%A A381677 _Juan Martin Rodriguez_, Mar 03 2025