Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156944
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156944 Let d(i) be the i-th digit of the decimal expansion of e = 2.718281828459045235360287471352662..., so that d(1) = 2, d(2) = 7, d(3) = 1, etc. Then a[n_] := d(10 - d(n)). +0
1
8, 1, 2, 7, 8, 7, 2, 7, 8, 7, 8, 2, 2, 8, 8, 2, 8, 1, 2, 1, 8, 8, 8, 7, 1, 8, 1, 2, 1, 2, 8, 8, 8, 8, 8, 2, 1, 1, 2, 1, 8, 8, 1, 8, 2, 1, 8, 2, 2, 2, 2, 2, 2, 1, 8, 2, 8, 8, 2, 8, 1, 8, 8, 1, 1, 8, 8, 8, 1, 8, 8, 1, 8, 1, 2, 1, 2, 8, 1, 2, 2, 8, 2, 1, 2, 1, 7, 8, 2, 1, 7, 2, 8, 2, 2, 8, 8, 8, 8, 1, 8, 8, 1, 8, 8 (list; graph; listen)
OFFSET

1,1

COMMENT

This is NOT base sequence because in the seed sequence d(i) may be any integer, then a(n)=d(M-d(n)) with M>maximal value of d(i).

CROSSREFS

Cf. A135725.

Sequence in context: A088373 A154167 A140242 this_sequence A021127 A010155 A019607

Adjacent sequences: A156941 A156942 A156943 this_sequence A156945 A156946 A156947

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Feb 18 2009

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research