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.

A245537 Write n>=1 as either n=2^k-2^r with 0 <= r <= k-1, in which case a(2^k-2^r)=A083424(k-r-1), or as n=2^k-2^r+j with 2 <= r <= k-1, 1 <= j < 2^r-1, in which case a(2^k-2^r+j)=A083424(k-r-1)*a(j).

This page as a plain text file.
%I A245537 #8 Feb 22 2025 19:07:59
%S A245537 1,1,3,1,1,3,14,1,1,1,3,3,3,14,52,1,1,1,3,1,1,3,14,3,3,3,9,14,14,52,
%T A245537 216,1,1,1,3,1,1,3,14,1,1,1,3,3,3,14,52,3,3,3,9,3,3,9,42,14,14,14,42,
%U A245537 52,52,216,848,1,1,1,3,1,1,3,14,1,1,1,3,3,3,14,52
%N A245537 Write n>=1 as either n=2^k-2^r with 0 <= r <= k-1, in which case a(2^k-2^r)=A083424(k-r-1), or as n=2^k-2^r+j with 2 <= r <= k-1, 1 <= j < 2^r-1, in which case  a(2^k-2^r+j)=A083424(k-r-1)*a(j).
%C A245537 Similar to A245180, except the multiplier 8 in that recurrence is set here to be 1.
%C A245537 See A245196 for a list of other sequences produced by this type of recurrence.
%e A245537 Arranged into blocks:
%e A245537 1,
%e A245537 1, 3,
%e A245537 1, 1, 3, 14,
%e A245537 1, 1, 1, 3, 3, 3, 14, 52,
%e A245537 1, 1, 1, 3, 1, 1, 3, 14, 3, 3, 3, 9, 14, 14, 52, 216,
%e A245537 1, 1, 1, 3, 1, 1, 3, 14, 1, 1, 1, 3, 3, 3, 14, 52, 3, 3, 3, 9, 3, 3, 9, 42, 14, 14, 14, 42, 52, 52, 216, 848,
%e A245537 ...
%Y A245537 Cf. A083424, A245180, A245196.
%K A245537 nonn,tabf
%O A245537 1,3
%A A245537 _N. J. A. Sloane_, Jul 26 2014