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.

A332895 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].

This page as a plain text file.
%I A332895 #9 Mar 04 2020 18:08:52
%S A332895 0,1,2,2,5,4,10,4,5,10,42,8,21,20,8,8,85,10,170,20,21,84,682,16,11,42,
%T A332895 8,40,341,16,2730,16,85,170,16,20,1365,340,40,40,5461,42,10922,168,17,
%U A332895 1364,43690,32,23,22,168,84,21845,16,80,80,341,682,174762,32,87381,5460,40,32,43,170,699050,340,1365,32,2796202
%N A332895 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].
%H A332895 Antti Karttunen, <a href="/A332895/b332895.txt">Table of n, a(n) for n = 1..16384</a>
%F A332895 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].
%F A332895 For n > 1, a(2n) = 2*a(n).
%F A332895 For n >= 1, a(A108546(n)) = A000975(n); A000120(a(n)) = A332897(n).
%o A332895 (PARI) A332895(n) = if(n<=2,n-1,2*A332895(A332893(n)) + (1==(n%4)));
%Y A332895 Cf. A000975, A108546, A332815, A332893, A332896, A332897.
%Y A332895 Cf. also A292385.
%K A332895 nonn
%O A332895 1,3
%A A332895 _Antti Karttunen_, Mar 04 2020