OFFSET
1,2
MATHEMATICA
Select[Fibonacci[Range[2, 100]], IntegerDigits[#, 10][[1]] == 1 &] (* T. D. Noe, Nov 01 2006 *)
PROG
(PARI) select(x->(digits(x)[1] == 1), vector(85, n, fibonacci(n+1))) \\ Michel Marcus, Jan 30 2019
(Magma) [Fibonacci(n): n in [2..100] | Intseq(Fibonacci(n))[#Intseq(Fibonacci(n))] eq 1]; // Vincenzo Librandi, Jan 30 2019
(Scala) def fibonacci(n: BigInt): BigInt = {
val zero = BigInt(0)
def fibTail(n: BigInt, a: BigInt, b: BigInt): BigInt = n match {
case `zero` => a
case _ => fibTail(n - 1, b, a + b)
}
fibTail(n, 0, 1)
} // Tail recursion by Dario Carrrasquel
((2 to 100).map(fibonacci(_))).filter(_.toString.startsWith("1")) // Alonso del Arte, Apr 22 2019
CROSSREFS
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Corrected by T. D. Noe, Nov 01 2006
STATUS
approved