Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131510 c(n)=nth integer such that its description by frequency followed by digit (as in A005150)=0 mod c(n). +0
1
1, 2, 5, 22, 32, 62, 91, 183, 188, 190, 196, 258, 276, 330, 671, 710, 1130, 1210, 1570, 2644, 2998 (list; graph; listen)
OFFSET

1,2

EXAMPLE

1=0 mod 1 then a(1) =1

12=0 mod 2, then c(2)=2

13=1 mod 3, then c(3) is not 3

122918=0 mod 2998, then 2998 occurs in the sequence

CROSSREFS

Cf; A005150.

Sequence in context: A024686 A024475 A024600 this_sequence A136488 A041165 A041006

Adjacent sequences: A131507 A131508 A131509 this_sequence A131511 A131512 A131513

KEYWORD

easy,nonn

AUTHOR

Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Aug 14 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 December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research