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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286461 Compound filter (2-adic valuation of n & 4k+1,4k+3 prime-signature combination of 2n-1): a(n) = P(A001511(n), A286364((2*n)-1)), where P(n,k) is sequence A000027 used as a pairing function. 3
 1, 5, 4, 9, 22, 5, 4, 32, 4, 5, 121, 9, 46, 437, 4, 20, 121, 17, 4, 24, 4, 5, 67, 14, 22, 17, 4, 24, 121, 5, 4, 2562, 211, 5, 121, 9, 4, 107, 121, 14, 7261, 5, 211, 24, 4, 17, 121, 41, 4, 2280, 4, 9, 254, 5, 4, 32, 4, 17, 67, 24, 22, 17, 631, 35, 121, 5, 121, 783, 4, 5, 121, 32, 211, 2280, 4, 9, 67, 17, 4, 41, 121, 5, 254, 9, 46, 2280, 4, 140, 121, 5, 4, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 Eric Weisstein's World of Mathematics, Pairing Function Indranil Ghosh, Python program to generate the sequence FORMULA a(n) = (1/2)*(2 + ((A001511(n)+A286364((2*n)-1))^2) - A001511(n) - 3*A286364((2*n)-1)). PROG (Scheme) (define (A286461 n) (* (/ 1 2) (+ (expt (+ (A001511 n) (A286364 (+ n n -1))) 2) (- (A001511 n)) (- (* 3 (A286364 (+ n n -1)))) 2))) CROSSREFS Cf. A000027, A001511, A046523, A278223, A286161, A286364, A286371, A286372, A286463, A286465. Sequence in context: A022344 A046588 A086654 * A152064 A088482 A163888 Adjacent sequences:  A286458 A286459 A286460 * A286462 A286463 A286464 KEYWORD nonn AUTHOR Antti Karttunen, May 10 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 May 15 01:50 EDT 2021. Contains 343909 sequences. (Running on oeis4.)