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.

A356350 Primitive terms of A357769: terms of A357769 that are not ten times another term of A357769.

This page as a plain text file.
%I A356350 #7 Oct 17 2022 07:12:23
%S A356350 1,2,3,4,5,6,7,8,9,12,18,24,36,48,102,108,110,112,114,126,132,140,150,
%T A356350 156,190,204,210,216,220,224,228,230,252,264,270,280,306,312,330,336,
%U A356350 396,408,420,440,448,460,510,540,550,624,630,660,690,756,770,840,880
%N A356350 Primitive terms of A357769: terms of A357769 that are not ten times another term of A357769.
%C A356350 This sequence is infinite as it contains A133384.
%C A356350 Each term of A357769 can be uniquely written as a(m)*10^z for some m > 0 and z >= 0.
%H A356350 <a href="/index/De#decimal_expansion">Index entries for sequences related to decimal expansion of n</a>
%e A356350 230 is a term as 230 belongs to A357769 and 23 does not belong to A357769.
%e A356350 756 is a term as 756 belongs to A357769 and is not divisible by 10.
%o A356350 (PARI) isA357769(n, base=10) = { my (d=digits(n, base), s=0); for (k=1, #d, if (n % (s+=d[k]), return (0)); ); return (1) }
%o A356350 is(n, base=10) = isA357769(n, base) && (n%base || !isA357769(n/base, base))
%Y A356350 Cf. A133384, A356349, A357769.
%K A356350 nonn,base
%O A356350 1,2
%A A356350 _Bernard Schott_ and _Rémy Sigrist_, Oct 15 2022