Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124476
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124476 Smallest multiple of A047201(n) (i.e. numbers not divisible by 5) with only digits 6 and 7. +0
1
67, 76, 6777, 76, 7776, 6776, 776, 6777, 6677, 7776, 676, 6776, 7776, 6766, 7776, 76, 67767, 6776, 667, 7776, 676, 6777, 6776, 667, 67766, 7776, 66777777, 6766, 7776, 666777, 76, 77766, 7667, 76776, 676777, 6776, 67666, 667776, 7776, 67767, 67677 (list; graph; listen)
OFFSET

1,1

LINKS

N. Hobson, Solution to Puzzle 80:"Sixes and sevens" (generalization of)

MATHEMATICA

f[n_] := Block[{k = n}, While[Union @ IntegerDigits[k] != {6, 7}, k += n]; k]; f /@ Select[Range[52], Mod[ #, 5] > 0 &] (*Chandler*)

CROSSREFS

Sequence in context: A039432 A043255 A044035 this_sequence A066475 A106930 A106929

Adjacent sequences: A124473 A124474 A124475 this_sequence A124477 A124478 A124479

KEYWORD

nonn,base

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Dec 17 2006

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 18 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research