The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265354 Permutation of nonnegative integers: a(n) = A263273(A264985(n)). 11
 0, 1, 3, 2, 4, 9, 6, 10, 12, 7, 5, 19, 8, 13, 27, 18, 28, 36, 21, 11, 57, 24, 37, 30, 15, 31, 39, 22, 16, 64, 23, 14, 55, 20, 46, 58, 25, 17, 73, 26, 40, 81, 54, 82, 108, 63, 29, 171, 72, 109, 90, 45, 85, 117, 66, 34, 192, 69, 38, 165, 60, 100, 174, 75, 35, 219, 78, 118, 84, 33, 91, 93, 48, 32, 138, 51, 112, 111, 42, 94, 120, 67 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Composition of A263273 with the permutation obtained from its odd bisection. LINKS Antti Karttunen, Table of n, a(n) for n = 0..9841 FORMULA a(n) = A263273(A264985(n)). PROG (Scheme) (define (A265354 n) (A263273 (A264985 n))) (Python) from sympy import factorint from sympy.ntheory.factor_ import digits from operator import mul def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3) def a038502(n):     f=factorint(n)     return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f]) def a038500(n): return n/a038502(n) def a263273(n): return 0 if n==0 else a030102(a038502(n))*a038500(n) def a264985(n): return (a263273(2*n + 1) - 1)/2 def a(n): return a263273(a264985(n)) # Indranil Ghosh, May 22 2017 CROSSREFS Inverse: A265353. Cf. A263273, A264985. Cf. also A265352, A265355, A265356. Sequence in context: A173028 A264985 A265355 * A265356 A083164 A094962 Adjacent sequences:  A265351 A265352 A265353 * A265355 A265356 A265357 KEYWORD nonn,base AUTHOR Antti Karttunen, Dec 07 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 01:05 EST 2020. Contains 330995 sequences. (Running on oeis4.)