Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135102
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135102 Digital sum (base the n-th prime) of Fibonacci(n). +0
2
1, 1, 2, 3, 5, 8, 13, 3, 12, 27, 29, 36, 33, 41, 58, 51, 31, 64, 89, 45, 74, 83, 39, 168, 145, 193, 170, 129, 149, 104, 211, 289, 274, 175, 257, 252, 125, 161, 318, 347, 447, 316, 317, 285, 450, 107, 253, 648, 363, 301, 498, 409, 773, 522, 429, 515, 782, 649, 641 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n)=ds_prime(n)(Fib(n)), where ds_prime(n)=digital sum base the n-th prime.

a(n)=Fib(n)-(prime(n)-1)*sum{k>0, floor(Fib(n)/prime(n)^k)}.

EXAMPLE

a(2)=ds_prime(2)(Fib(2))=ds_3(1)=1; a(10)=ds_prime(10)(55)=ds_29(55)=1+26=27.

CROSSREFS

Cf. A000040, A000045, A007953, A054899, A075771, A131451, A133620, A133900, A134599.

Sequence in context: A018149 A118604 A072123 this_sequence A078414 A050416 A079345

Adjacent sequences: A135099 A135100 A135101 this_sequence A135103 A135104 A135105

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Dec 24 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research