The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A060236

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A060236

If n mod 3 = 0 then a(n) = a(n/3), otherwise a(n) = n mod 3.
(history; published version)

#46 by Michael De Vlieger at Tue Jan 23 08:41:23 EST 2024

STATUS

reviewed

approved

#45 by Joerg Arndt at Tue Jan 23 06:28:43 EST 2024

STATUS

proposed

reviewed

#44 by Kevin Ryde at Tue Jan 23 06:17:41 EST 2024

STATUS

editing

proposed

#43 by Kevin Ryde at Tue Jan 23 06:16:36 EST 2024

CROSSREFS

Cf. A026140 and A026225 for sequence of n's for which a(n)=1, A026179 for sequence of n's for which a(n)=2.

Cf. A026225 (indices of 1's), A026179 (indices of 2's).

Discussion

Tue Jan 23

06:17

Kevin Ryde: A026225 is the better one of A026140 and A026225, since the other A026140 has an extra initial 0 not applicable here.

#42 by Kevin Ryde at Tue Jan 23 06:14:11 EST 2024

FORMULA

nts of mappings</a>

CROSSREFS

Cf. A026140 and A026225 for sequence of n's for which a(n)=1, A026179 for sequence of n's for which a(n)=2. k-th term of A060032 is concatenation of first 3^k terms of a(n).

Cf. A060032 (concatenate 3^n terms).

STATUS

approved

editing

#41 by Andrey Zabolotskiy at Sun Mar 26 14:31:28 EDT 2023

STATUS

editing

approved

#40 by Andrey Zabolotskiy at Sun Mar 26 14:31:24 EDT 2023

MATHEMATICA

Table[Mod[n/3^IntegerExponent[n, 3], 3], {n, 1, 120}] (* Clark Kimberling, Oct 19 2016 *)

PROG

Table[Mod[n/3^IntegerExponent[n, 3], 3], {n, 1, 120}] (* Clark Kimberling, Oct 19 2016 *)

STATUS

approved

editing

#39 by Joerg Arndt at Sat Jul 10 02:00:04 EDT 2021

STATUS

reviewed

approved

#38 by Michel Marcus at Sat Jul 10 00:56:16 EDT 2021

STATUS

proposed

reviewed

#37 by Jon E. Schoenfield at Sat Jul 10 00:16:17 EDT 2021

STATUS

editing

proposed