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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261304 a(n+1) = abs(a(n) - gcd(a(n), 4n+3)), a(1) = 1. 1
1, 0, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 59, 58, 57, 56, 55, 54, 53, 52, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 251, 250, 249, 248, 247, 246, 245, 244, 243, 242, 241, 240, 239, 238, 237, 236 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

The absolute value is relevant only when a(n) = 0, in which case a(n+1) = gcd(a(n), 4n+3) = 4n+3.

It is conjectured that a(n) = 0 implies that 4n+3 = a(n+1) is prime, cf. A186256. (This is the sequence {u(n)} mentioned there.)

LINKS

Table of n, a(n) for n=1..78.

PROG

(PARI) print1(a=1); for(n=1, 199, print1(", ", a=abs(a-gcd(a, 4*n+3))))

CROSSREFS

Cf. A261301 - A261310, A186253 - A186263, A106108.

Sequence in context: A065001 A022967 A023453 * A055122 A279650 A004452

Adjacent sequences:  A261301 A261302 A261303 * A261305 A261306 A261307

KEYWORD

nonn

AUTHOR

M. F. Hasler, Aug 14 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 November 17 05:27 EST 2019. Contains 329217 sequences. (Running on oeis4.)