login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A257696 a(0) = 0; for n >= 1, a(n) = GCD(A060130(n),a(A257684(n))). 6
0, 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 1, 1, 2, 3, 3, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..10080

Index entries for sequences related to factorial base representation

FORMULA

a(0) = 0; for n >= 1, a(n) = GCD(A060130(n),a(A257684(n))).

PROG

(Scheme, with memoizing definec-macro)

(definec (A257696 n) (cond ((zero? n) 0) (else (gcd (A060130 n) (A257696 (A257684 n))))))

CROSSREFS

Cf. A060130, A257684, A257694, A257695.

Sequence in context: A228431 A165620 A128494 * A110730 A198339 A262561

Adjacent sequences:  A257693 A257694 A257695 * A257697 A257698 A257699

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 23:01 EST 2018. Contains 318081 sequences. (Running on oeis4.)