This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A290093 Compound filter (for base-3 digit runlengths): a(n) = P(A290091(n), A290092(n)), where P(n,k) is sequence A000027 used as a pairing function. 10
 1, 3, 2, 3, 10, 5, 2, 5, 7, 3, 21, 5, 10, 36, 14, 5, 27, 12, 2, 5, 16, 5, 14, 23, 7, 12, 29, 3, 21, 5, 21, 78, 27, 5, 27, 12, 10, 78, 14, 36, 136, 44, 14, 90, 25, 5, 27, 23, 27, 90, 61, 12, 42, 38, 2, 5, 16, 5, 14, 23, 16, 23, 67, 5, 27, 23, 14, 44, 40, 23, 61, 80, 7, 12, 67, 12, 25, 80, 29, 38, 121, 3, 21, 5, 21, 78, 27, 5, 27, 12, 21, 465, 27, 78, 300, 90, 27 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For all i, j: a(i) = a(j) => A006047(i) = A006047(j) => A053735(i) = A053735(j). LINKS Antti Karttunen, Table of n, a(n) for n = 0..19683 FORMULA a(n) = (1/2)*(2 + ((A290091(n)+A290092(n))^2) - A290091(n) - 3*A290092(n)). PROG (Scheme) (define (A290093 n) (* (/ 1 2) (+ (expt (+ (A290091 n) (A290092 n)) 2) (- (A290091 n)) (- (* 3 (A290092 n))) 2))) CROSSREFS Cf. A000027, A278222, A289813, A289814, A290091, A290092. Cf. A006047, A053735, A290079 (some of the matched sequences). Sequence in context: A120879 A118064 A292024 * A186102 A170848 A078017 Adjacent sequences:  A290090 A290091 A290092 * A290094 A290095 A290096 KEYWORD nonn AUTHOR Antti Karttunen, Jul 25 2017 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 December 13 19:41 EST 2018. Contains 318087 sequences. (Running on oeis4.)