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.

A367606 Comma-successor to n working in base 3, but written in base 10, or -1 if n has no successor.

This page as a plain text file.
%I A367606 #27 Jul 28 2024 09:21:33
%S A367606 5,9,4,-1,12,8,11,15,10,14,19,13,17,22,16,21,25,20,24,27,23,-1,30,26,
%T A367606 29,33,28,32,36,31,35,39,34,38,42,37,41,45,40,44,48,43,47,51,46,50,55,
%U A367606 49,53,58,52,57,61,56,60,64,59,63,67,62,66,70,65,69,73,68,72,76,71,75,79,74,78,81,77,-1,84,80,83,87,82
%N A367606 Comma-successor to n working in base 3, but written in base 10, or -1 if n has no successor.
%C A367606 This is a base-3 analog of A367338.
%C A367606 It seems that the indices of the terms equal to -1 are in A168613. - _Ivan N. Ianakiev_, Dec 12 2023
%C A367606 This is true for A168613(n), n >= 2.  See proofs in A367341. - _Michael S. Branicky_, Dec 15 2023
%H A367606 Michael S. Branicky, <a href="/A367606/b367606.txt">Table of n, a(n) for n = 1..10000</a>
%o A367606 (Python)
%o A367606 from sympy.ntheory.factor_ import digits
%o A367606 def a(n):
%o A367606     b = n + 3*(n%3)
%o A367606     return next((b+y for y in [1, 2] if digits(b+y, 3)[1] == y), -1)
%o A367606 print([a(n) for n in range(1, 82)]) # _Michael S. Branicky_, Dec 11 2023
%Y A367606 Cf. A121085, A168613, A367338, A367341, A367355, A367356, A367607, A367608, A367609.
%K A367606 sign,base
%O A367606 1,1
%A A367606 _N. J. A. Sloane_, Dec 11 2023