Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038810 a(n) is the number of ways to write the number n as dk...di...d2d1d0 where digit di represents di * (di+1)^i, restricting di to 0..9. +0
1
1, 1, 2, 2, 3, 3, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 9, 9, 11, 11, 13, 13, 13, 13, 15, 15, 16, 16, 17, 17, 17, 17, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 24, 24, 25, 25, 27, 27, 26, 26, 30, 30, 32, 32, 33, 33, 36, 36, 39, 39, 39, 39, 38, 38, 39, 39, 39, 39, 42, 42, 44 (list; graph; listen)
OFFSET

0,3

EXAMPLE

a(7)=5 since 7 = (7*8^0) = (1*2^1)+(5*6^0) = (2*3^1)+(1*2^0) = (1*2^2)+(0*1^1)+(3*4^0) = (1*2^2)+(1*2^1)+(1*2^0), which are the numbers {7,15,21,103,111}.

CROSSREFS

Adjacent sequences: A038807 A038808 A038809 this_sequence A038811 A038812 A038813

Sequence in context: A108221 A082524 A099961 this_sequence A086609 A035031 A035032

KEYWORD

nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp)

EXTENSIONS

More terms and additional comments from Larry Reeves (larryr(AT)acm.org), Mar 16 2001.

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 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research