login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073550 Number of Fibonacci numbers F(k), k <= 10^n, which end in 1. 3
3, 14, 134, 1334, 13334, 133334, 1333334, 13333334, 133333334, 1333333334, 13333333334, 133333333334, 1333333333334, 13333333333334, 133333333333334, 1333333333333334, 13333333333333334, 133333333333333334 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = ceiling((10^n-1)/60) + ceiling((10^n-2)/60) + ceiling((10^n-8)/60) + ceiling((10^n-19)/60) + ceiling((10^n-22)/60) + ceiling((10^n-28)/60) + ceiling((10^n-41)/60) + ceiling((10^n-59)/60).
a(n) = ceiling(40/3*10^(n-1)) for n>1. - Benoit Cloitre, Aug 27 2002; [Edited by Felix Fröhlich, Jun 08 2019]
EXAMPLE
a(2) = 14 because there are 14 Fibonacci numbers up to 10^2 which end in 1.
CROSSREFS
Cf. A072675. Different from A072509.
Sequence in context: A096657 A365997 A126933 * A319361 A367422 A002966
KEYWORD
base,nonn
AUTHOR
Shyam Sunder Gupta, Aug 15 2002
EXTENSIONS
More terms from Vladeta Jovovic, Aug 20 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)