Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140195
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140195 Same as A140191 except here e=9. +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 4, 1, 2, 2, 4, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 4, 2, 4, 1, 1, 2, 2, 2, 2, 4, 4, 1, 2, 2, 4, 2, 4, 4, 8, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 3, 2, 3, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 2, 4, 4, 7, 2, 4, 4, 7, 1, 1, 1, 2, 2, 2, 2, 3, 2 (list; graph; listen)
OFFSET

0,10

LINKS

Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..3000

PROGRAM

See link in A140191 for Fortran program.

CROSSREFS

Sequence in context: A107279 A078461 A111621 this_sequence A022927 A063435 A000034

Adjacent sequences: A140192 A140193 A140194 this_sequence A140196 A140197 A140198

KEYWORD

nonn

AUTHOR

Nadia Heninger (nadiah(AT)cs.princeton.edu) and N. J. A. Sloane (njas(AT)research.att.com), Jun 06 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research