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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248033 Least number k such that k + n divides F(n)^2 + F(k)^2. 0
1, 3, 2, 1, 5, 19, 18, 17, 16, 3, 14, 12, 4, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 25, 99, 98, 9, 36, 95, 94, 93, 92, 91, 90, 12, 88, 23, 50, 10, 68, 83, 22, 81, 80, 79, 11, 24, 76, 15, 74, 73, 5, 71, 18, 29, 8, 67, 66, 12, 28, 63, 62, 1, 20, 47, 58, 41, 56, 40, 54, 17, 24, 11, 50, 49, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

F(n) denotes the n-th Fibonacci number. I believe a(n) exists for all n > 0.

LINKS

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

PROG

(PARI)

a(n)=m=1; while((fibonacci(n)^2+fibonacci(m)^2)%(m+n), m++); m

vector(100, n, a(n))

CROSSREFS

Cf. A000045, A247937, A248032.

Sequence in context: A108123 A105954 A144252 * A318254 A002130 A089145

Adjacent sequences:  A248030 A248031 A248032 * A248034 A248035 A248036

KEYWORD

nonn

AUTHOR

Derek Orr, Sep 29 2014

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 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)