Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152888
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152888 The sequence of powers necessary to reconstruct Exp[0] from Thanh Diep's sequence A081368: E=Sum[A081368[n]/10^a(n),{n,1,Length}]. +0
1
0, 2, 5, 9, 14, 21, 28, 36, 45, 55, 66, 77, 90, 104, 119, 135, 152, 170 (list; graph; listen)
OFFSET

0,2

REFERENCES

C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 350-351.

FORMULA

E = Sum[A081368[n]/10^a(n),{n,1,Length}]; Solve for a(n).

MATHEMATICA

Clear[a, n];

a = {2, 71, 828, 1828, 45904, 5235360, 2874713, 52662497, 757247093, 6999595749, 66967627724, 76630353547,

5945713821785, 25166427427466, 391932003059921, 8174135966290435, 72900334295260595, 630738132328627943};

b = Table[Length[IntegerDigits[a[[n]]]], {n, 1, Length[a]}];

c = Table[Sum[b[[m]], {m, 1, n}] - 1, {n, 1, Length[b]}] Sum[a[[n]]/10^(c[[n]]), {n, 1, Length[a]}];

N[% - E, 100]

CROSSREFS

Sequence in context: A048093 A024669 A006482 this_sequence A139423 A026053 A011905

Adjacent sequences: A152885 A152886 A152887 this_sequence A152889 A152890 A152891

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 14 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research