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.
%I A038468 #14 Apr 05 2025 14:57:04
%S A038468 364,850,1012,1066,1084,1090,1092,2308,2470,2524,2542,2548,2550,2956,
%T A038468 3010,3028,3034,3036,3172,3190,3196,3198,3244,3250,3252,3268,3270,
%U A038468 3276,6682,6844,6898,6916,6922,6924,7330,7384,7402,7408,7410,7546,7564,7570,7572,7618
%N A038468 Sums of 6 distinct powers of 3.
%H A038468 Amiram Eldar, <a href="/A038468/b038468.txt">Table of n, a(n) for n = 1..10000</a>
%t A038468 Sort[Plus @@@ Subsets[3^Range[0, 8], {6}]] (* _Amiram Eldar_, Jul 12 2022 *)
%o A038468 (Python)
%o A038468 from itertools import islice
%o A038468 def A038468_gen(): # generator of terms
%o A038468 yield int(bin(n:=63)[2:],3)
%o A038468 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:],3)
%o A038468 A038468_list = list(islice(A038468_gen(),30)) # _Chai Wah Wu_, Apr 05 2025
%Y A038468 Cf. A000244, A038464, A038465, A038466, A038467, A038469.
%Y A038468 Base 3 interpretation of A038448.
%K A038468 nonn,easy
%O A038468 1,1
%A A038468 _Olivier Gérard_
%E A038468 Offset corrected by _Amiram Eldar_, Jul 12 2022