cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A172439 Fibonacci sequence rewritten using A006942.

Original entry on oeis.org

6, 2, 2, 5, 5, 5, 7, 25, 52, 54, 55, 76, 244, 555, 533, 626, 673, 2563, 5574, 4272, 6365, 26646, 23322, 57653, 46567, 35655, 252565, 266427, 523722, 524556, 755646, 2546566, 5237566, 5554537, 5365773, 6553465, 24656555, 54253723, 56677266
Offset: 0

Views

Author

Parthasarathy Nambi, Feb 02 2010

Keywords

Comments

For Fibonacci numbers containing two or more digits, just concatenate the digits.
Digit 0 ==> 6;1 ==> 2;2 ==> 5;3 ==> 5;4 ==> 4;5 ==> 5;6 ==> 6;7 ==> 3;8 ==> 7;9 ==> 6.

Examples

			4181 is a Fibonacci number and using A006942 this is 4272.
		

Crossrefs

Cf. A000045.

Programs

  • Maple
    A172439 := proc(n) if n = 0 then 6; else F := convert(combinat[fibonacci](n),base,10) ; dgs := [] ; for i from 1 to nops(F) do dgs := [op(dgs),op(1+op(i,F),[ 6, 2, 5, 5, 4, 5, 6, 3, 7, 6])] ; end do ; add( op(i,dgs)*10^(i-1),i=1..nops(dgs)) ; end if; end proc: seq(A172439(n),n=0..40) ; # R. J. Mathar, Feb 08 2010
  • Mathematica
    FromDigits[IntegerDigits[#]/.{0->6,1->2,2->5,3->5,7->3,8->7,9->6}]&/@ Fibonacci[ Range[0,40]] (* Harvey P. Dale, Aug 31 2020 *)
  • PARI
    my(A006942=[6,2,5,5,4,5,6,3,7,6]); a(n) = if(n==0,6, fromdigits(apply(d->A006942[d+1], digits(fibonacci(n))))); \\ Kevin Ryde, Sep 01 2020

Extensions

More terms from R. J. Mathar, Feb 08 2010