|
|
A367556
|
|
Comma transform of the Fibonacci numbers.
|
|
1
|
|
|
1, 11, 12, 23, 35, 58, 81, 32, 13, 45, 58, 91, 42, 33, 76, 9, 71, 72, 44, 16, 51, 61, 12, 74, 87, 51, 31, 83, 15, 98, 1, 92, 93, 85, 79, 51, 22, 73, 96, 61, 51, 12, 64, 77, 31, 1, 32, 34, 67, 91, 52, 43, 95, 38, 21, 52, 73, 25, 99, 11, 2, 14, 16, 21, 31, 52, 84
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
See A367360 for further information.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
F:= combinat[fibonacci]:
a:= n-> parse(cat(""||(F(n))[-1], ""||(F(n+1))[1])):
seq(a(n), n=0..92);
|
|
MATHEMATICA
|
With[{nmax=100}, Map[10Mod[#[[1]], 10]+IntegerDigits[#[[2]]][[1]]&, Partition[Fibonacci[Range[0, nmax+1]], 2, 1]]] (* Paolo Xausa, Nov 24 2023 *)
|
|
PROG
|
(Python)
from sympy import fibonacci
from itertools import islice, pairwise, count
def S(): yield from (fibonacci(i) for i in count(0))
def C(g): # generator of comma transform of sequence passed as a generator
yield from (10*(t%10) + int(str(u)[0]) for t, u in pairwise(g))
def agen(): return C(S())
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|