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.

A353413 a(n) = A000265(A064216(n)).

This page as a plain text file.
%I A353413 #8 Apr 20 2022 09:58:40
%S A353413 1,1,3,5,1,7,11,3,13,17,5,19,9,1,23,29,7,15,31,11,37,41,3,43,25,13,47,
%T A353413 21,17,53,59,5,33,61,19,67,71,9,35,73,1,79,39,23,83,55,29,51,89,7,97,
%U A353413 101,15,103,107,31,109,57,11,65,49,37,27,113,41,127,85,3,131,137,43,77,69,25,139,149,13,87,151,47,95
%N A353413 a(n) = A000265(A064216(n)).
%H A353413 Antti Karttunen, <a href="/A353413/b353413.txt">Table of n, a(n) for n = 1..16384</a>
%H A353413 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A353413 a(n) = A353412(2*n-1) = A000265(A064216(n)).
%F A353413 For all n >= 1, A000120(a(n)) = A254044(n).
%o A353413 (PARI)
%o A353413 A000265(n) = (n>>valuation(n,2));
%o A353413 A064989(n) = { my(f = factor(A000265(n))); for(i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f); };
%o A353413 A353413(n) = A000265(A064989(n+n-1));
%Y A353413 Odd bisection of A353412.
%Y A353413 Cf. A000120, A000265, A064216, A064989, A254044.
%Y A353413 Cf. also A285702.
%K A353413 nonn
%O A353413 1,3
%A A353413 _Antti Karttunen_, Apr 18 2022