Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136386
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136386 Quotient obtained when A037097(n) is considered as a GF(2)[X]-polynomial, and it is divided by (x + 1) ^ A000225(n-1) (= A051179(n-2)). +0
4
4, 8, 352, 3728, 7269662752, 761166466256046848, 390022035611646394530728097023856870592, 91600670557117582933643002658167825054614175029432880501373395030525438396928, 13417853484388319477475698658536993288839029124735549539652836318808118017743106\ 800015257954250357092148394821846783842030516713870361254572407216621548672 (list; graph; listen)
OFFSET

3,1

LINKS

A. Karttunen, Table of n, a(n) for n = 3..13

A. Karttunen, C program for computing this sequence

CROSSREFS

A136387 shows the same sequence in binary base. Cf. A037096, A037097, A136380, A136382, A136384.

Adjacent sequences: A136383 A136384 A136385 this_sequence A136387 A136388 A136389

Sequence in context: A090653 A065022 A012994 this_sequence A013443 A013442 A013441

KEYWORD

nonn,base

AUTHOR

Antti Karttunen (His_Firstname.His_Surname(AT)gmail.com), Dec 29 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research