Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136428
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136428 First differences of A064770. +0
2
1, 0, 0, 1, 0, 0, 0, 0, 1, 7, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, 7, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0, 0, 0, 0, 1, 7, 1, 0, 0, 1, 0, 0, 0, 0, 1, 67, 1, 0, 0, 1, 0, 0, 0, 0, 1, 7, 1, 0, 0, 1, 0, 0, 0, 0, 1, -3, 1, 0, 0, 1, 0 (list; graph; listen)
OFFSET

0,10

COMMENT

a(10*n+k) = 0 for k = 1, 2, 4, 5, 6, 7;

a(10*n+k) = 1 for k = 0, 3, 8;

a(100*n+10*k+9) = -3 for k = 1, 2, 4, 5, 6, 7;

a(100*n+10*k+9) = 7 for k = 0, 3, 8;

a(1000*n+100*k+99) = -33 for k = 1, 2, 4, 5, 6, 7;

a(1000*n+100*k+99) = 67 for k = 0, 3, 8.

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..9999

FORMULA

a(n) = (2*A010052(m mod 10) - 1)*rounded(((1+A010052(m mod 10))*10^k)/3) where n = m*10^k - 1 with m mod 10 > 0.

CROSSREFS

Sequence in context: A024094 A036949 A059515 this_sequence A053878 A070672 A055061

Adjacent sequences: A136425 A136426 A136427 this_sequence A136429 A136430 A136431

KEYWORD

sign

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 30 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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research