Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jan 26 2021 05:56:09
%S 1,2,5,11,23,53,293,24773,422573,86203853
%N Indices of records of A067148.
%C For the known terms, A067148(a(n))=n+1, a(n) is odd for n>2 and a(n)==2 (mod 3) for n>1. Do these trends continue?
%t 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 ]; For[ n=1; max=-1, True, n++, If[ a[ n ]>max, Print[ n ]; max=a[ n ] ] ]
%Y Cf. A067148.
%K nonn,more
%O 1,2
%A _John W. Layman_, Jan 04 2002
%E Last term from _Dean Hickerson_, Jan 12 2002