login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004094 Powers of 2 written backwards. 10
1, 2, 4, 8, 61, 23, 46, 821, 652, 215, 4201, 8402, 6904, 2918, 48361, 86723, 63556, 270131, 441262, 882425, 6758401, 2517902, 4034914, 8068838, 61277761, 23445533, 46880176, 827712431, 654534862, 219078635, 4281473701, 8463847412 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Freeman Dyson believes that A014963(a(n))<>5 is true but cannot be proved, see link. - Reinhard Zumkeller, Jan 05 2005

a(n) = A004086(A000079(n)). - Reinhard Zumkeller, Apr 02 2014

LINKS

T. D. Noe, Table of n, a(n) for n = 0..1000

Richard Lipton, More on testing Dyson's conjecture (2014)

Edge Foundation, Annual Question 2005

PROG

(Haskell)

a004094 = a004086 . a000079  -- Reinhard Zumkeller, Apr 02 2014

(PARI) rev(n)=subst(Polrev(digits(n)), 'x, 10)

a(n)=rev(2^n) \\ Charles R Greathouse IV, Oct 20 2014

CROSSREFS

Cf. A102382, A102383, A102384, A102385.

Sequence in context: A206850 A094333 A018473 * A028910 A018482 A036447

Adjacent sequences:  A004091 A004092 A004093 * A004095 A004096 A004097

KEYWORD

nonn,base,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Reinhard Zumkeller, Jan 05 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 17 19:40 EST 2017. Contains 294834 sequences.