This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A264984 Even bisection of A263273; terms of A263262 doubled. 5
 0, 2, 4, 6, 8, 10, 12, 22, 16, 18, 20, 14, 24, 26, 28, 30, 64, 46, 36, 58, 40, 66, 76, 34, 48, 70, 52, 54, 56, 38, 60, 74, 32, 42, 68, 50, 72, 62, 44, 78, 80, 82, 84, 190, 136, 90, 172, 118, 192, 226, 100, 138, 208, 154, 108, 166, 112, 174, 220, 94, 120, 202, 148, 198, 184, 130 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n) = 2 * A263272(n). a(n) = A263273(2*n). Other identities. For all n >= 0: A010873(a(n)) = 2 * A000035(n) = A010673(n). PROG (Scheme) (define (A264984 n) (A263273 (+ n 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 a(n): return a263273(2*n) # Indranil Ghosh, May 22 2017 CROSSREFS Cf. A000035, A010673, A010873, A263272, A263273, A264983, A264975. Sequence in context: A113242 A309716 A198186 * A194390 A187688 A085884 Adjacent sequences:  A264981 A264982 A264983 * A264985 A264986 A264987 KEYWORD nonn AUTHOR Antti Karttunen, Dec 05 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 October 21 22:47 EDT 2019. Contains 328315 sequences. (Running on oeis4.)