login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120256 a(n) = number of terms in the n-th row of A120255(n) = number of terms in A001177 equal to n. 4
1, 0, 1, 1, 1, 2, 1, 2, 2, 2, 1, 10, 1, 2, 5, 4, 1, 10, 3, 11, 5, 2, 1, 55, 4, 2, 12, 11, 1, 52, 3, 8, 5, 2, 5, 133, 7, 4, 5, 46, 3, 52, 1, 27, 22, 6, 1, 260, 6, 40, 5, 11, 3, 100, 13, 78, 27, 6, 3, 874, 3, 4, 22, 48, 5, 52, 7, 27, 29, 116, 3, 1319, 3, 8, 36, 23, 13, 116, 3, 444, 112, 4, 1, 1834 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

T. D. Noe, Table of n, a(n) for n=1..300

EXAMPLE

Fibonacci(9) = 34; and the divisors of 34 are 1, 2, 17 and 34. Of these divisors, 1 and 2 divide earlier Fibonacci numbers, 17 and 34 do not. So a(9) = 2.

MATHEMATICA

f[t_] := Append[t, Select[Divisors[Fibonacci[Length[t] + 1]], FreeQ[Flatten[t], # ] &]]; Length /@ Nest[f, {}, 85] (*Chandler*)

CROSSREFS

Cf. A120255, A001177.

Sequence in context: A011776 A098965 A016443 * A114811 A219025 A043531

Adjacent sequences:  A120253 A120254 A120255 * A120257 A120258 A120259

KEYWORD

nonn

AUTHOR

Leroy Quet, Jun 13 2006

EXTENSIONS

Extended by Ray Chandler, Jun 14 2006

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 16 10:48 EDT 2014. Contains 240577 sequences.