cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A105859 Numbers m such that A104647(m) = A104647(m-1) + A104647(m-2).

This page as a plain text file.
%I A105859 #6 Aug 14 2018 21:04:08
%S A105859 2,3,4,5,6,9,12,17,21,25,30,37,38,39,42,46,47,51,55,56,61,66,73,74,79,
%T A105859 86,89,93,94,102,110,111,117,118,120,124,130,136,141,144,148,154,155,
%U A105859 158,162,170,171,172,173,177,185,186,187,188,189,190,195,201,206,212
%N A105859 Numbers m such that A104647(m) = A104647(m-1) + A104647(m-2).
%H A105859 Robert Israel, <a href="/A105859/b105859.txt">Table of n, a(n) for n = 1..10000</a>
%e A105859 n=12: A104647(12)=17 = A104647(11)+A104647(10)=9+8=7, therefore 12 is a term;
%e A105859 n=42: A104647(42)=60 = A104647(41)+A104647(40)=31+29=60, therefore 42 is a term.
%p A105859 N:= 10^3: # for all terms <= N
%p A105859 A104647:= Array(0..N):
%p A105859 A104647[1]:= 1:
%p A105859 for n from 2 to N do A104647[n]:= (A104647[n-1] mod n) + (A104647[n-2] mod n) od:
%p A105859 select(t -> (A104647[t] = A104647[t-1]+A104647[t-2]), [$2..N]); # _Robert Israel_, Aug 14 2018
%Y A105859 Cf. A105860.
%K A105859 nonn
%O A105859 1,1
%A A105859 _Reinhard Zumkeller_, Apr 23 2005