A037314 -id:A037314 - cp's OEIS frontend

A120437 Differences of A037314 (sum of base-3 digits of n = sum of base-9 digits of n).

1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 547, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 547, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1

Offset: 1

John W. Layman, Jul 17 2006

It appears that sign(a(n+1) - a(n)) gives A102283. - Filip Zaludek, Oct 29 2016

This is clear: a(n) = 1 for n == 1 or 2 (mod 3), and a(n) >= 7 for n == 0 (mod 3): see comment by Franklin T. Adams-Watters on A037314. - Robert Israel, Nov 06 2016

Michel Marcus, Table of n, a(n) for n = 1..2000

Cf. A000695, A007949, A037314, A066443.

A037314[0]:= 0;
for n from 0 to 33 do for k from 0 to 2 do
  A037314[3*n+k]:= 9*A037314[n]+k
od od:
seq(A037314[i]-A037314[i-1],i=1..100); # Robert Israel, Nov 06 2016

Differences@ Table[FromDigits[RealDigits[n, 3], 9], {n, 1, 100}] (* Michael De Vlieger, Nov 10 2016, after Clark Kimberling at A037314 *)

a037314(n) = {my(d = digits(n, 3)); subst(Pol(d), x, 9); }
a(n) = a037314(n) - a037314(n-1); \\ Michel Marcus, Oct 30 2016

It appears that the sequence is given by the following recursion: a(n)=1 if n=1, a(n)=9a(3^(k-1))-2 if n=3^k for some k>0, a(n)=a(n-3^(k-1)) if 3^(k-1)0. This recursion formula has been verified for n<=2000.
a(n) = A066443(A007949(n)). (This is equivalent to the conjectured recursion above; that recursion is correct.) - Franklin T. Adams-Watters, Jul 24 2006
G.f. g(x) satisfies g(x) = 9 g(x^3) + x*(1+2*x)/(1+x+x^2). - Robert Israel, Nov 06 2016

A037457 Duplicate of A037314.

Original entry on oeis.org

1, 2, 9, 10, 11, 18, 19, 20, 81, 82, 83, 90, 91, 92, 99, 100, 101, 162, 163, 164

Offset: 1

dead

A066443 Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.

Original entry on oeis.org

1, 7, 61, 547, 4921, 44287, 398581, 3587227, 32285041, 290565367, 2615088301, 23535794707, 211822152361, 1906399371247, 17157594341221, 154418349070987, 1389765141638881, 12507886274749927, 112570976472749341

Offset: 0

John W. Layman, Aug 12 2002

All members of sequence are also hex, or central hexagonal, numbers (A003215). (If n is a hex number, 9n - 2 is always a hex number; see recurrence.) - Matthew Vandermast, Mar 30 2003
The sequence 1,1,7,61,547,... with g.f. (1-9x+6x^2)/((1-x)(1-9x)) and a(n) = A054879(n)/3 + 2*0^n/3 gives the denominators in the probability that a random walk on the cube returns to its starting corner on the 2n-th step. - Paul Barry, Mar 11 2004
Equals row sums of even row terms of triangle A158303. - Gary W. Adamson, Mar 15 2009
It appears that a(n) is the n-th record value in A120437, which gives the  differences of A037314 (positive integers n such that the sum of the base 3 digits of n equals the sum of the base 9 digits of n). - John W. Layman, Dec 14 2010
Numbers in base 9 are 1, 6+1, 66+1, 666+1, 6666+1, 66666+1, etc.; that is, n 6's + 1. - Yuchun Ji, Aug 15 2019
All prime factors of a(n) are 1 mod 6. In addition, if n is not 1 mod 3 (first index being n=0), then 3 is a cubic residue modulo all prime factors of a(n). This provides a simple proof that there are infinitely many primes 1 mod 6 that have 3 as a cubic residue. - William Hu, Jul 26 2024

			From _Michael B. Porter_, Aug 22 2016: (Start)
Give coordinates (a,b,c) to the vertices of the cube, where a, b, and c are either 0 or 1. For n = 1, the a(1) = 7 paths of length 2n + 1 = 3 from (0,0,0) to (0,0,1) are:
(0,0,0) -> (0,0,1) -> (0,0,0) -> (0,0,1)
(0,0,0) -> (0,0,1) -> (0,1,1) -> (0,0,1)
(0,0,0) -> (0,0,1) -> (1,0,1) -> (0,0,1)
(0,0,0) -> (0,1,0) -> (0,0,0) -> (0,0,1)
(0,0,0) -> (0,1,0) -> (0,1,1) -> (0,0,1)
(0,0,0) -> (1,0,0) -> (0,0,0) -> (0,0,1)
(0,0,0) -> (1,0,0) -> (1,0,1) -> (0,0,1) (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..200
G. Benkart and D. Moon, A Schur-Weyl Duality Approach to Walking on Cubes, arXiv preprint arXiv:1409.8154 [math.RT], 2014 and Ann. Combin. 20 (3) (2016) 397-417.
E. Estrada and J. A. de la Pena, From Integer Sequences to Block Designs via Counting Walks in Graphs, arXiv preprint arXiv:1302.1176 [math.CO], 2013. - _N. J. A. Sloane_, Feb 28 2013
E. Estrada and J. A. de la Pena, Integer sequences from walks in graphs, Notes on Number Theory and Discrete Mathematics, Vol. 19, 2013, No. 3, 78-84.
M. Kac, Random walk and the theory of Brownian motion, Amer. Math. Monthly, 54:369-391, 1947.
R. J. Mathar, Counting Walks on Finite Graphs, Nov 2020, Section 5.
Vladimir Pletser, Congruence conditions on the number of terms in sums of consecutive squared integers equal to squared integers, arXiv:1409.7969 [math.NT], 2014.
Eric Weisstein's World of Mathematics, Repunit
Index entries for linear recurrences with constant coefficients, signature (10,-9).

Cf. A158303, A037314, A120437, A083234 (binomial transform), A083233 (inverse binomial transform), A054879 (recurrent walks), A125857 (walks ending on face diagonal), A054880 (walks ending on space diagonal).

[(3^(2*n+1)+1)/4: n in [0..20]]; // Vincenzo Librandi, Jun 16 2011

seq((3^(2*n+1) + 1)/4, n=0..18); # Zerinvary Lajos, Jun 16 2007

NestList[9 # - 2 &, 1, 18] (* or *)
Table[(3^(2 n + 1) + 1)/4, {n, 0, 18}] (* or *)
CoefficientList[Series[(1 - 3 x)/((1 - x) (1 - 9 x)), {x, 0, 18}], x] (* Michael De Vlieger, Aug 22 2016 *)

a(n)=3^(2*n+1)\/4 \\ Charles R Greathouse IV, Jul 02 2013

Vec((1-3*x)/((1-x)*(1-9*x)) + O(x^50)) \\ Altug Alkan, Nov 13 2015

a(n) = (3^(2*n+1)+1)/4. - Vladeta Jovovic, Dec 22 2002
a(n) = 9*a(n-1) - 2. - Matthew Vandermast, Mar 30 2003
From Paul Barry, Apr 21 2003: (Start)
G.f.: (1-3*x)/((1-x)*(1-9*x)).
E.g.f.: (3*exp(9*x) + exp(x))/4. (End)
a(n) = (-1)^n times the (i, i)-th element of M^n (for any i), where M = ((1, 1, 1, -2), (1, 1, -2, 1), (1, -2, 1, 1), (-2, 1, 1, 1)). - Simone Severini, Nov 25 2004
a(n) = Sum_{k=0..n} binomial(2*n+1, 2*k)*4^(n-k). - Paul Barry, Jan 22 2005
a(n) = A054880(n) + 1.
a(n) = A057660(3^n). - Henry Bottomley, Nov 08 2015
a(n) = Sum_{k=0..2n} (-3)^k == 1 + Sum_{k=1..n} 2*3^(2k-1). - Bob Selcoe, Aug 21 2016
a(n) = 3^(2*n+1) * a(-1-n) for all n in Z. - Michael Somos, Jul 02 2017
a(n) = 6*A002452(n) + 1. - Yuchun Ji, Aug 15 2019

Corrected by Vladeta Jovovic, Dec 22 2002

A062891 When expressed in base 3 and then interpreted in base 9, is a multiple of the original number.

Original entry on oeis.org

0, 1, 2, 3, 6, 9, 13, 18, 26, 27, 34, 39, 47, 54, 78, 81, 91, 102, 117, 121, 141, 162, 182, 234, 242, 243, 262, 273, 306, 351, 363, 423, 486, 546, 702, 726, 729, 757, 786, 819, 918, 1048, 1053, 1089, 1093, 1183, 1269, 1458, 1514, 1638, 2106, 2178, 2186, 2187

Offset: 1

Erich Friedman, Jul 21 2001

			13 in base 3 is 111, which interpreted in base 9 is 91 = 7*13.

Harvey P. Dale, Table of n, a(n) for n = 1..751 [offset shifted by _Georg Fischer_, Jun 15 2021]

Cf. A007089 (base 3), A007095 (base 9), A037314 (base 3 -> 9).

Other digit spreads: A062846 (binary), A343550 (decimal).

q:= n-> (l-> n=0 or 0=irem(add(l[i]*9^(i-1),
         i=1..nops(l)), n))(convert(n, base, 3)):
select(q, [$0..3000])[];  # Alois P. Heinz, Apr 20 2021

Join[{0},Select[Range[2200],Divisible[FromDigits[IntegerDigits[#,3],9],#]&]] (* Harvey P. Dale, Apr 11 2017 *)

Offset changed to 1 by Kevin Ryde, Apr 24 2021

A163327 Self-inverse permutation of integers: swap the odd- and even-positioned digits in the ternary expansion of n, then convert back to decimal.

Original entry on oeis.org

0, 3, 6, 1, 4, 7, 2, 5, 8, 27, 30, 33, 28, 31, 34, 29, 32, 35, 54, 57, 60, 55, 58, 61, 56, 59, 62, 9, 12, 15, 10, 13, 16, 11, 14, 17, 36, 39, 42, 37, 40, 43, 38, 41, 44, 63, 66, 69, 64, 67, 70, 65, 68, 71, 18, 21, 24, 19, 22, 25, 20, 23, 26, 45, 48, 51, 46, 49, 52, 47, 50, 53

Offset: 0

Antti Karttunen, Jul 29 2009

			11 in ternary base (A007089) is written as '(000...)102' (... + 0*27 + 1*9 + 0*3 + 2), which results '1020' = 1*27 + 0*9 + 2*3 + 0 = 33, when the odd- and even-positioned digits are swapped, thus a(11) = 33.

Antti Karttunen, Table of n, a(n) for n = 0..728
Index entries for sequences that are permutations of the natural numbers

Cf. A007089, A163328-A163329.

Other bases: A057300, A126006, A217558.

from sympy.ntheory import digits
def a(n):
    d = digits(n, 3)[1:]
    return sum(3**(i+(1-2*(i&1)))*di for i, di in enumerate(d[::-1]))
print([a(n) for n in range(72)]) # Michael S. Branicky, Aug 05 2022

(define (A163327 n) (+ (A037314 (A163326 n)) (* 3 (A037314 (A163325 n)))))

a(n) = A037314(A163326(n)) + 3*A037314(A163325(n))

Edited by Charles R Greathouse IV, Nov 01 2009

A051022 Interpolate 0's between each pair of digits of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 500, 501, 502, 503, 504, 505

Offset: 0

Eric W. Weisstein, Dec 11 1999

These numbers have the same decimal and negadecimal representations.

Or fixed points of decimal negadecimal conversion. - Gerald Hillier, Apr 23 2015

			a(23) = 203.
a(99) = 909.
a(100) = 10000.
a(101) = 10001.
a(111) = 10101.

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Negadecimal

Cf. A039723, A063010, A092908 (primes), A092909 (on primes), A338754 (*11).

In other bases: A000695, A037314, A276089.

a051022 n = if n < 10 then n else a051022 n' * 100 + r
            where (n', r) = divMod n 10
-- Reinhard Zumkeller, Apr 20 2011
(HP 49G calculator)
« "" + SREV 0 9
  FOR i i "" + DUP 0 + SREPL DROP
  NEXT SREV OBJ->
». Gerald Hillier, Apr 23 2015

M:= 3: # to get a(0) to a(10^M-1)
A:= 0:
for d from 1 to M do
  A:= seq(seq(a*100+b,b=0..9),a=A);
od:
A; # Robert Israel, Apr 23 2015

Table[FromDigits[Riffle[IntegerDigits[n],0]],{n,0,60}] (* Harvey P. Dale, Nov 17 2013 *)
ToNegaBases[i_Integer, b_Integer] := FromDigits[ Rest[ Reverse[ Mod[ NestWhileList[(#1 - Mod[ #1, b])/-b &, i, #1 != 0 &], b]]]];
k = 0; lst = {}; While[k < 1001, If[k == ToNegaBases[k, 10], AppendTo[ lst, k]]; k++]; lst (* Robert G. Wilson v, Jun 11 2014 *)

a(n) = fromdigits(digits(n),100); \\ Kevin Ryde, Nov 07 2020

def a(n): return int("0".join(str(n)))
print([a(n) for n in range(56)]) # Michael S. Branicky, Aug 15 2022

Sums a_i*100^e_i with 0 <= a_i < 10.
a(n) = n if n < 10, otherwise a(floor(n/10))*100 + n mod 10. - Reinhard Zumkeller, Apr 20 2011 [Corrected by Kevin Ryde, Nov 07 2020]
a(n) = A338754(n)/11. - Kritsada Moomuang, Oct 20 2019 [Corrected by Kevin Ryde, Nov 07 2020]

More terms and more precise definition from Jorge Coveiro, Apr 15 2004 and David Wasserman, Feb 26 2008
Edited by N. J. A. Sloane, Sep 14 2008 at the suggestion of R. J. Mathar
Offset fixed by Reinhard Zumkeller, Apr 20 2012

A163325 Pick digits at the even distance from the least significant end of the ternary expansion of n, then convert back to decimal.

Original entry on oeis.org

0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 4, 5, 3, 4, 5, 3, 4, 5, 6, 7, 8, 6, 7, 8, 6, 7, 8, 0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 4, 5, 3, 4, 5, 3, 4, 5, 6, 7, 8, 6, 7, 8, 6, 7, 8, 0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 4, 5, 3, 4, 5, 3, 4, 5, 6, 7, 8, 6, 7, 8, 6, 7, 8, 9, 10, 11, 9, 10, 11, 9, 10, 11, 12, 13, 14, 12, 13, 14

Offset: 0

Antti Karttunen, Jul 29 2009

			11 in ternary base (A007089) is written as '102' (1*9 + 0*3 + 2), from which we pick the "zeroth" and 2nd digits from the right, giving '12' = 1*3 + 2 = 5, thus a(11) = 5.

Antti Karttunen, Table of n, a(n) for n = 0..728
Kevin Ryde, Plot2 of X=A163325,Y=A163326, illustrating the ternary Z-order curve.
Index entries for sequences related to coordinates of 2D curves

A059905 is an analogous sequence for binary.

Cf. A007089, A163327, A163328, A163329.

a(n) = fromdigits(digits(n,9)%3,3); \\ Kevin Ryde, May 14 2020

a(0) = 0, a(n) = (n mod 3) + 3*a(floor(n/9)).
a(n) = Sum_{k>=0} {A030341(n,k)*b(k)} where b is the sequence (1,0,3,0,9,0,27,0,81,0,243,0... = A254006): powers of 3 alternating with zeros. - Philippe Deléham, Oct 22 2011
A037314(a(n)) + 3*A037314(A163326(n)) = n for all n.

Edited by Charles R Greathouse IV, Nov 01 2009

A163328 Square array A, where entry A(y,x) has the ternary digits of x interleaved with the ternary digits of y, converted back to decimal. Listed by antidiagonals: A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ...

Original entry on oeis.org

0, 1, 3, 2, 4, 6, 9, 5, 7, 27, 10, 12, 8, 28, 30, 11, 13, 15, 29, 31, 33, 18, 14, 16, 36, 32, 34, 54, 19, 21, 17, 37, 39, 35, 55, 57, 20, 22, 24, 38, 40, 42, 56, 58, 60, 81, 23, 25, 45, 41, 43, 63, 59, 61, 243, 82, 84, 26, 46, 48, 44, 64, 66, 62, 244, 246, 83, 85, 87, 47, 49

Offset: 0

Antti Karttunen, Jul 29 2009

			From _Kevin Ryde_, Oct 06 2020: (Start)
Array A(y,x) read by downwards antidiagonals, so 0, 1,3, 2,4,6, etc.
        x=0   1   2   3   4   5   6   7   8
      +--------------------------------------
  y=0 |   0,  1,  2,  9, 10, 11, 18, 19, 20,
    1 |   3,  4,  5, 12, 13, 14, 21, 22,
    2 |   6,  7,  8, 15, 16, 17, 24,
    3 |  27, 28, 29, 36, 37, 38,
    4 |  30, 31, 32, 39, 40,
    5 |  33, 34, 35, 42,
    6 |  54, 55, 56,
    7 |  57, 58,
    8 |  60,
(End)

Antti Karttunen, Table of n, a(n) for n = 0..3320
Index entries for sequences that are permutations of the natural numbers

Inverse: A163329. Transpose: A163330. Cf. A037314 (row y=0), A208665 (column x=0)

Cf. A054238 is an analogous sequence for binary. Cf. A007089, A163327, A163332, A163334.

A(y,x) = 3*fromdigits(digits(y,3),9) + fromdigits(digits(x,3),9); \\ Kevin Ryde, Oct 06 2020

(define (A163328 n) (+ (A037314 (A025581 n)) (* 3 (A037314 (A002262 n)))))

a(n) = A037314(A025581(n)) + 3*A037314(A002262(n))

a(n) = A163327(A163330(n)).

Edited by Charles R Greathouse IV, Nov 01 2009

A163326 Pick digits at the odd distance from the least significant end of the ternary expansion of n, then convert back to decimal.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 3, 3, 3, 4, 4, 4, 5, 5, 5, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 6, 6, 6, 7, 7, 7, 8, 8, 8, 6, 6, 6, 7, 7, 7, 8, 8, 8, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0

Offset: 0

Antti Karttunen, Jul 29 2009

			42 in ternary base (A007089) is written as '1120' (1*27 + 1*9 + 2*3 + 0), from which we pick the first and 3rd digits from the right (zero-based!), giving '12' = 1*3 + 2 = 5, thus a(42) = 5.

Antti Karttunen, Table of n, a(n) for n = 0..728
Kevin Ryde, Plot2 of X=A163325,Y=A163326, illustrating the ternary Z-order curve.
Index entries for sequences related to coordinates of 2D curves

A059906 is an analogous sequence for binary. Note that A037314(A163325(n)) + 3*A037314(A163326(n)) = n for all n. Cf. A007089, A163327-A163329.

a(n) = fromdigits(digits(n,9)\3,3); \\ Kevin Ryde, May 15 2020

a(n) = A163325(floor(n/3))

a(n) = Sum_{k>=0} A030341(n,k)*b(k) with (b) = (0,1,0,3,0,9,0,27,0,81,0,243,0,...): powers of 3 alternating with zeros. - Philippe Deléham, Oct 22 2011

Edited by Charles R Greathouse IV, Nov 01 2009

A338086 Duplicate the ternary digits of n, so each 0, 1 or 2 becomes 00, 11 or 22 respectively.

Original entry on oeis.org

0, 4, 8, 36, 40, 44, 72, 76, 80, 324, 328, 332, 360, 364, 368, 396, 400, 404, 648, 652, 656, 684, 688, 692, 720, 724, 728, 2916, 2920, 2924, 2952, 2956, 2960, 2988, 2992, 2996, 3240, 3244, 3248, 3276, 3280, 3284, 3312, 3316, 3320, 3564, 3568, 3572, 3600, 3604

Offset: 0

Kevin Ryde, Oct 09 2020

Also, numbers whose ternary digit runs are all even lengths (including 0 reckoned as no digits at all).  Also, change ternary digits 0,1,2 to base 9 digits 0,4,8, and hence numbers which can be written in base 9 using only digits 0,4,8.
Digit duplication 00,11,22 can be compared to A037314 which is 0 above each so 00,01,02, or A208665 which is 0 below each so 00,10,20.  Duplication is the sum of these, or any one is a suitable multiple of another (*3, *4, etc).
This sequence is the points on the X=Y diagonal of the ternary Z-order curve (see example table in A163328).  The Z-order curve takes a point number p and splits its ternary digits alternately to X and Y coordinates so X(p) = A163325(p) and Y(p) = A163326(p).  Duplicate digits in a(n) are the diagonal X(a(n)) = Y(a(n)) = n.

			n=73 is ternary 2201 which duplicates to 22220011 ternary = 8804 base 9 = 6484 decimal.

Kevin Ryde, Table of n, a(n) for n = 0..6560

Cf. A037314, A208665, A163325, A163326, A163328.
Cf. A020331 (ternary concatenation).
Digit duplication in other bases: A001196, A338754.

PARI
```
a(n) = fromdigits(digits(n,3),9)<<2;
```

from gmpy2 import digits
def A338086(n): return int(''.join(d*2 for d in digits(n,3)),3) # Chai Wah Wu, May 07 2022

a(n) = A037314(n) + A208665(n) = 4*A037314(n) = (4/3)*A208665(n).

a(n) = 4*Sum_{i=0..k} d[i]*9^i where the ternary expansion of n is n = Sum_{i=0..k} d[i]*3^i with digits d[i]=0,1,2.

cp's OEIS Frontend

A120437 Differences of A037314 (sum of base-3 digits of n = sum of base-9 digits of n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A037457 Duplicate of A037314.

Views

Author

Keywords

A066443 Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Formula

Extensions

A062891 When expressed in base 3 and then interpreted in base 9, is a multiple of the original number.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A163327 Self-inverse permutation of integers: swap the odd- and even-positioned digits in the ternary expansion of n, then convert back to decimal.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Scheme

Formula

Extensions

A051022 Interpolate 0's between each pair of digits of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Formula

Extensions

A163325 Pick digits at the even distance from the least significant end of the ternary expansion of n, then convert back to decimal.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs