cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A335393 a(1) = 1 and for any n >= 1, a(2*n) = a(n) + 5, a(2*n+1) = a(n) * 3.

This page as a plain text file.
%I A335393 #11 Jun 06 2020 01:51:17
%S A335393 1,6,3,11,18,8,9,16,33,23,54,13,24,14,27,21,48,38,99,28,69,59,162,18,
%T A335393 39,29,72,19,42,32,81,26,63,53,144,43,114,104,297,33,84,74,207,64,177,
%U A335393 167,486,23,54,44,117,34,87,77,216,24,57,47,126,37,96,86,243
%N A335393 a(1) = 1 and for any n >= 1, a(2*n) = a(n) + 5, a(2*n+1) = a(n) * 3.
%C A335393 All terms belong to A335155.
%C A335393 For any k > 0, the value k appears A335392(k) times.
%H A335393 Rémy Sigrist, <a href="/A335393/b335393.txt">Table of n, a(n) for n = 1..8192</a>
%F A335393 a(2^k) = 1 + 5*k for any k >= 0.
%F A335393 a(2^k-1) = 2^(k-1) for any k > 0.
%e A335393 a(12) = a(6) + 5 = a(3) + 5 + 5 = a(1) * 3 + 5 + 5 = 1 * 3 + 5 + 5 = 13.
%o A335393 (PARI) a(n) = { if (n==1, 1, n%2==0, a(n\2)+5, a(n\2)*3) }
%Y A335393 Cf. A335155, A335365, A335392.
%K A335393 nonn
%O A335393 1,2
%A A335393 _Rémy Sigrist_, Jun 05 2020