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!)
A358359 a(n) = number of occurrences of n in A128440; i.e., as a number [k*r^m], where r = golden ratio = (1+sqrt(5))/2, k and m are positive integers, and [ ] = floor. 1
1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Conjecture: every positive integers occurs infinitely many times.
LINKS
MATHEMATICA
r = (1 + Sqrt[5])/2; f[n_] := Fibonacci[n]; nr = 300; nc = 200;
t[n_, k_] := k*f[n - 1] + Floor[k*r*f[n]]; (* A128440 *)
u = Sort[Flatten[Table[t[k, n], {k, 1, nr}, {n, 1, nc}]]];
Table[Count[u, n], {n, 1, nr}]
CROSSREFS
Cf. A128440.
Sequence in context: A107450 A341765 A104248 * A249973 A343854 A069349
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 11 2022
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 July 19 20:58 EDT 2024. Contains 374436 sequences. (Running on oeis4.)