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 A343639 #16 Jun 04 2021 07:13:57 %S A343639 0,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,2,2,2, %T A343639 1,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,2,1,1,1,1,1,2,2,2,2,2,2,1, %U A343639 1,1,1,2,2,2,2,2,2,2,1,1,1,2,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2 %N A343639 a(n) = (Sum of digits of 9*n) / 9. %C A343639 Similar to, but different from A193582, A326307, ... %C A343639 Consider g = A008585 = multiply by 3, and its left inverse h = A002264, h o g = id (but g o h = id only on (the range of) A008585). In the spirit of group theory, we can write ad(g) = (x -> h o x o g), then A343638 = ad(A008585)(A007953) and this A343639 = ad(A008585)(A343638) = ad(A008585)^2 (A007953). %F A343639 a(n) = A007953(A008591(n))/9, by definition. - _Felix Fröhlich_, May 19 2021 %F A343639 a(n) = A343638(3*n)/3 = A002264(A343638(A008585(n))), i.e., A343639 = A002264 o A343638 o A008585 (just as A343638 = A002264 o A007953 o A008585). %t A343639 a[n_] := Plus @@ IntegerDigits[9*n]/9; Array[a, 100, 0] (* _Amiram Eldar_, May 19 2021 *) %o A343639 (PARI) A343639(n)=sumdigits(9*n)/9 %Y A343639 Cf. A007953 (digit sum), A008591 (9n), A343638 (similar for 3), A083824 (9*n reversed and divided by 9), A279777 (a(n)=3). %K A343639 nonn,base,easy %O A343639 0,12 %A A343639 _M. F. Hasler_, May 19 2021