Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134586
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134586 a(n) = a(n-1) + u(n) if a(n-1) not divisible 2 else a(n) = a(n-1) / 2, where u(n) is the product of digits of n (A007954) +0
1
1, 2, 1, 4, 2, 1, 7, 14, 7, 16, 8, 4, 2, 1, 5, 10, 5, 12, 6, 3, 3, 5, 9, 15, 23, 33, 45, 59, 75, 93, 93, 96, 48, 24, 12, 6, 3, 24, 12, 6, 3, 7, 15, 27, 43, 63, 87, 115, 147, 183, 183, 188, 94, 47, 67, 92, 46, 23, 63, 108, 54, 27, 39, 57, 81, 111, 147, 189, 237, 291, 291, 298, 149 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A007954.

Adjacent sequences: A134583 A134584 A134585 this_sequence A134587 A134588 A134589

Sequence in context: A104582 A133938 A074586 this_sequence A135287 A089606 A140740

KEYWORD

base,nonn

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Jan 24 2008

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 October 6 15:53 EDT 2008. Contains 144667 sequences.


AT&T Labs Research