The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284563 a(n) = A247503(A277324(n)). 5
2, 2, 2, 10, 10, 10, 50, 10, 10, 250, 250, 50, 250, 250, 50, 110, 110, 250, 6250, 1250, 1250, 31250, 6250, 550, 2750, 6250, 6250, 13750, 2750, 2750, 6050, 110, 110, 30250, 68750, 13750, 343750, 781250, 156250, 151250, 151250, 781250, 19531250, 1718750, 343750, 8593750, 756250, 6050, 30250, 756250, 1718750, 3781250, 3781250, 8593750, 18906250, 151250 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = A247503(A277324(n)).
a(n) = A284553((2*n)+1).
Other identities. For all n >= 0:
A001222(a(n)) = A284565(n).
MATHEMATICA
a[n_] := a[n] = Which[n < 2, n + 1, EvenQ@ n, Times @@ Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[# == 1] &@ a[n/2], True, a[#] a[# + 1] &[(n - 1)/2]]; Table[Times @@ (FactorInteger[#] /. {p_, e_} /; e > 0 :> (p^Mod[PrimePi@ p, 2])^e) &@ a[2 n + 1], {n, 0, 55}] (* Michael De Vlieger, Apr 05 2017 *)
PROG
(PARI) A284563(n) = A284553(n+n+1); \\ Other code as in A284553.
(Scheme)
(define (A284563 n) (A247503 (A277324 n)))
(define (A284563 n) (A284553 (+ n n 1)))
CROSSREFS
Odd bisection of A284553.
Sequence in context: A125695 A152681 A215603 * A138674 A351174 A254706
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 29 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 19:55 EDT 2024. Contains 372522 sequences. (Running on oeis4.)