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.

A292608 a(n) = 2*n + 1 + valuation(n, 2) with valuation(n, 2) = A007814(n).

This page as a plain text file.
%I A292608 #13 Mar 25 2022 18:26:28
%S A292608 3,6,7,11,11,14,15,20,19,22,23,27,27,30,31,37,35,38,39,43,43,46,47,52,
%T A292608 51,54,55,59,59,62,63,70,67,70,71,75,75,78,79,84,83,86,87,91,91,94,95,
%U A292608 101,99,102,103,107,107,110,111,116,115,118,119,123,123,126
%N A292608 a(n) = 2*n + 1 + valuation(n, 2) with valuation(n, 2) = A007814(n).
%C A292608 Duplicated terms 11, 27, 43, 59, ... are A106839 (verified with 1000 terms). - _Jean-François Alcover_, Sep 24 2017 (comment made further to an e-mail from Paul Curtz)
%p A292608 a := n -> 2*n + 1 + padic:-ordp(n, 2): seq(a(n), n=1..62);
%t A292608 a[n_] := 2n + 1 + IntegerExponent[n, 2]; Array[a, 62]
%o A292608 (PARI) a(n) = 2*n+1+valuation(n, 2); \\ _Michel Marcus_, Sep 25 2017
%Y A292608 Cf. A007814, A106839.
%K A292608 nonn
%O A292608 1,1
%A A292608 _Peter Luschny_, Sep 23 2017