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.

A038453 Sums of 11 distinct powers of 10.

This page as a plain text file.
%I A038453 #23 Mar 11 2025 09:54:39
%S A038453 11111111111,101111111111,110111111111,111011111111,111101111111,
%T A038453 111110111111,111111011111,111111101111,111111110111,111111111011,
%U A038453 111111111101,111111111110,1001111111111,1010111111111,1011011111111,1011101111111,1011110111111,1011111011111,1011111101111
%N A038453 Sums of 11 distinct powers of 10.
%H A038453 Amiram Eldar, <a href="/A038453/b038453.txt">Table of n, a(n) for n = 1..10000</a>
%t A038453 Union[Total/@Subsets[10^Range[0,12],{11}]] (* _Harvey P. Dale_, Jan 20 2013 *)
%o A038453 (PARI) lista(nn) = {for (n=1, nn, if (hammingweight(n) == 11, print1(subst(Pol(binary(n)), x, 10), ", ");););} \\ _Michel Marcus_, Feb 29 2016
%o A038453 (Python)
%o A038453 from itertools import islice
%o A038453 def A038453_gen(): # generator of terms
%o A038453     yield int(bin(n:=2047)[2:])
%o A038453     while True: yield int(bin((n:=n^((a:=-n&n+1)|(a>>1)) if n&1 else ((n&~(b:=n+(a:=n&-n)))>>a.bit_length())^b))[2:])
%o A038453 A038453_list = list(islice(A038453_gen(),20)) # _Chai Wah Wu_, Mar 11 2025
%Y A038453 Cf. A011557.
%Y A038453 Cf. A038444, A038445, A038446, A038447, A038448, A038449, A038450, A038451, A038452, A038454.
%K A038453 nonn,easy
%O A038453 1,1
%A A038453 _Olivier Gérard_
%E A038453 Offset changed to 1 by _Ivan Neretin_, Feb 28 2016