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.

A221129 Numbers of form k*2^n + n where 1 <= k < 2^n and n > 0.

This page as a plain text file.
%I A221129 #13 Jan 21 2019 15:00:07
%S A221129 3,6,10,11,14,19,20,27,35,36,37,43,51,52,59,68,69,70,84,100,101,116,
%T A221129 132,133,134,135,148,164,165,180,196,197,198,212,228,229,244,261,262,
%U A221129 263,264,293,325,326,357,389,390,391,421,453,454,485,517,518,519,520,521
%N A221129 Numbers of form k*2^n + n where 1 <= k < 2^n and n > 0.
%C A221129 Subsequence of primes: 3, 11, 19, 37, 43, 59, 101, 197, 229, 263, ...
%H A221129 Robert Israel, <a href="/A221129/b221129.txt">Table of n, a(n) for n = 1..10000</a>
%e A221129 a(6) = 19 = 2 *2^3 + 3.
%p A221129 N:= 1000: # to get all terms <= N
%p A221129 sort([seq(seq(k*2^n+n,k=1..min(2^n-1,(N-n)/2^n)),n=1..ilog2(N))]); # _Robert Israel_, Jan 21 2019
%t A221129 seqUpTo[n_] := Select[Union@Flatten@Table[k*2^h + h, {h, Floor@Log[2, n]}, {k, Min[2^h - 1, Floor[n/2^h]]}], # <= n &]; seqUpTo[521] (* _Giovanni Resta_, Jan 08 2013 *)
%Y A221129 Cf. A221130, A199116.
%K A221129 nonn
%O A221129 1,1
%A A221129 _Jaroslav Krizek_, Jan 02 2013