cp's OEIS Frontend

A067148 Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0 with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.

%I A067148 #10 Jan 26 2021 04:09:41
%S A067148 0,1,1,1,2,1,2,2,2,1,3,1,3,2,2,1,3,2,2,2,3,1,4,1,2,2,2,2,4,1,2,2,3,2,
%T A067148 3,1,3,3,2,1,3,1,3,2,3,1,4,2,2,2,2,1,5,1,3,2,2,2,3,2,3,2,3,1,3,1,2,3,
%U A067148 3,1,3,1,4,2,2,2,4,2,2,2,2,1,4,1,3,3,2,2,4,1,2,2,4,1,3,1,3,3,3,1,4,1,3,2,2
%N A067148 Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0<i<n, with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.
%t A067148 a[ n_ ] := Module[ {}, If[ n==2, Return[ 1 ] ]; For[ f0=3; f1=2; f2=1; c=0, f0<=n, f0=(f2=f1)+(f1=f0), If[ Mod[ n-f0, f2 ]==0, c++ ] ]; c ]
%Y A067148 Cf. A067149 gives the indices of records. See A067150 for a variation.
%K A067148 nonn
%O A067148 1,5
%A A067148 _John W. Layman_, Jan 04 2002
%E A067148 Edited by _Dean Hickerson_, Jan 17 2002