|
%I #34 Feb 26 2024 02:00:51
%S 14,19,28,47,61,75,122,149,183,199,244,298,305,323,366,427,488,497,
%T 549,646,795,911,969,1292,1301,1499,1822,1999,2087,2602,2733,2998,
%U 3089,3248,3379,3644,3903,4555,4997,5204,5466,6178,6377,6496,6505,7288,7806,7995
%N Numbers k whose representation can be split in two parts which can be used as seeds for a Fibonacci-like sequence containing k itself.
%C The 6 terms with two digits are also Keith numbers. There are 233 numbers below 10^6 in this sequence.
%H Michel Marcus, <a href="/A130792/b130792.txt">Table of n, a(n) for n = 1..406</a> (first 200 terms from Paolo Lava)
%e 122 can be split into 12 and 2 and the Fibonacci-like sequence: 12, 2, 14, 16, 30, 46, 76, 122, ... contains 122 itself.
%t testQ[n_]:= Block[{x, y, z, p = 10, r = False}, While[p < n, x = Floor[n/p]; y = Mod[n, p]; While[y < n, z = x + y; x = y; y = z]; If[y == n, r = True; Break[]]; p *= 10]; r]; Select[Range[10^4],testQ]
%o (PARI) isok(n) = {nb = #Str(n); for (i=1, nb-1, x = n\10^i; y = n - 10^i*x; ok = 0; while(!ok, z = x + y; if (z > n, ok = 1); if (z == n, return (1)); x = y; y = z;));} \\ _Michel Marcus_, Oct 08 2014
%Y Cf. A007629.
%K base,nonn
%O 1,1
%A _Giovanni Resta_, Aug 20 2007
|
